./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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-ext/09_fmaxsym-zero.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 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:35:53,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:35:53,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 12:35:53,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:35:53,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:35:53,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:35:53,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:35:53,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:35:53,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:35:53,158 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:35:53,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:35:53,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:35:53,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:35:53,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:35:53,160 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:35:53,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:35:53,161 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 12:35:53,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:35:53,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:35:53,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:35:53,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:35:53,164 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:35:53,164 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:35:53,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:53,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:35:53,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:35:53,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:35:53,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:35:53,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:35:53,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:35:53,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:35:53,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:35:53,165 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 -> 41cf9d90b654ba629ed26494b45977a61fd5035aced9f092d4e43a94133522bd [2025-02-06 12:35:53,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:35:53,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:35:53,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:35:53,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:35:53,438 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:35:53,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-02-06 12:35:54,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab5a581d7/b9dc7fe4362c4efc99d5e18c6544674e/FLAG908624957 [2025-02-06 12:35:54,999 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:35:55,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/09_fmaxsym-zero.i [2025-02-06 12:35:55,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab5a581d7/b9dc7fe4362c4efc99d5e18c6544674e/FLAG908624957 [2025-02-06 12:35:55,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ab5a581d7/b9dc7fe4362c4efc99d5e18c6544674e [2025-02-06 12:35:55,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:35:55,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:35:55,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:55,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:35:55,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:35:55,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1300f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55, skipping insertion in model container [2025-02-06 12:35:55,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:35:55,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:55,615 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:35:55,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:35:55,684 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:35:55,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55 WrapperNode [2025-02-06 12:35:55,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:35:55,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:55,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:35:55,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:35:55,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,736 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-02-06 12:35:55,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:35:55,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:35:55,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:35:55,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:35:55,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,766 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-02-06 12:35:55,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,785 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:35:55,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:35:55,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:35:55,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:35:55,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (1/1) ... [2025-02-06 12:35:55,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:35:55,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:35:55,842 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-06 12:35:55,851 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-06 12:35:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:35:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:35:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:35:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 12:35:55,877 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 12:35:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 12:35:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:35:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:35:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:35:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:35:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 12:35:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:35:55,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:35:55,878 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 12:35:56,005 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:35:56,007 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:35:56,188 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 12:35:56,188 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:35:56,289 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:35:56,290 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:35:56,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:56 BoogieIcfgContainer [2025-02-06 12:35:56,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:35:56,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:35:56,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:35:56,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:35:56,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:35:55" (1/3) ... [2025-02-06 12:35:56,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4ffb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:56, skipping insertion in model container [2025-02-06 12:35:56,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:35:55" (2/3) ... [2025-02-06 12:35:56,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4ffb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:35:56, skipping insertion in model container [2025-02-06 12:35:56,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:35:56" (3/3) ... [2025-02-06 12:35:56,302 INFO L128 eAbstractionObserver]: Analyzing ICFG 09_fmaxsym-zero.i [2025-02-06 12:35:56,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:35:56,322 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09_fmaxsym-zero.i that has 2 procedures, 23 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-02-06 12:35:56,322 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 12:35:56,376 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:35:56,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 26 transitions, 56 flow [2025-02-06 12:35:56,436 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2025-02-06 12:35:56,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:56,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 3/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 43 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-02-06 12:35:56,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 26 transitions, 56 flow [2025-02-06 12:35:56,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 26 transitions, 56 flow [2025-02-06 12:35:56,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:56,477 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;@6e3be946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:56,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-02-06 12:35:56,484 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:56,484 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:35:56,488 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:56,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:56,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:35:56,489 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:35:56,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash 187754, now seen corresponding path program 1 times [2025-02-06 12:35:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:56,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609220930] [2025-02-06 12:35:56,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:56,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:35:56,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:35:56,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:56,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:56,716 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-06 12:35:56,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:56,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609220930] [2025-02-06 12:35:56,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609220930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:56,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:56,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328025198] [2025-02-06 12:35:56,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:56,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:35:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:56,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:35:56,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:35:56,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 26 [2025-02-06 12:35:56,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 56 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-06 12:35:56,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:56,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 26 [2025-02-06 12:35:56,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:56,805 INFO L124 PetriNetUnfolderBase]: 17/61 cut-off events. [2025-02-06 12:35:56,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:56,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 61 events. 17/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 139 event pairs, 14 based on Foata normal form. 6/65 useless extension candidates. Maximal degree in co-relation 95. Up to 44 conditions per place. [2025-02-06 12:35:56,807 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 12 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-02-06 12:35:56,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 68 flow [2025-02-06 12:35:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:35:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:35:56,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 33 transitions. [2025-02-06 12:35:56,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6346153846153846 [2025-02-06 12:35:56,822 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 56 flow. Second operand 2 states and 33 transitions. [2025-02-06 12:35:56,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 68 flow [2025-02-06 12:35:56,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 68 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:35:56,831 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 44 flow [2025-02-06 12:35:56,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-02-06 12:35:56,836 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2025-02-06 12:35:56,836 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 44 flow [2025-02-06 12:35:56,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-06 12:35:56,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:56,837 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 12:35:56,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:35:56,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-02-06 12:35:56,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1300409495, now seen corresponding path program 1 times [2025-02-06 12:35:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:56,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700594323] [2025-02-06 12:35:56,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:56,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:56,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:56,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:56,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:56,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:56,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:35:56,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:56,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:56,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:56,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:56,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:35:56,892 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:35:56,893 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-02-06 12:35:56,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-02-06 12:35:56,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-02-06 12:35:56,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 8 remaining) [2025-02-06 12:35:56,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-02-06 12:35:56,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-02-06 12:35:56,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-02-06 12:35:56,895 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-02-06 12:35:56,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:35:56,896 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 12:35:56,898 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:35:56,898 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 12:35:56,925 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:35:56,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 45 transitions, 100 flow [2025-02-06 12:35:56,943 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-02-06 12:35:56,943 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 12:35:56,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 54 events. 6/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 41. Up to 3 conditions per place. [2025-02-06 12:35:56,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 45 transitions, 100 flow [2025-02-06 12:35:56,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 45 transitions, 100 flow [2025-02-06 12:35:56,947 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:56,948 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;@6e3be946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:56,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-06 12:35:56,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:56,955 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:35:56,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:56,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:56,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:35:56,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:35:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 232439, now seen corresponding path program 1 times [2025-02-06 12:35:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840192786] [2025-02-06 12:35:56,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:56,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:35:56,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:35:56,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:56,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:56,992 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-06 12:35:56,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:56,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840192786] [2025-02-06 12:35:56,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840192786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:56,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:56,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:56,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667598261] [2025-02-06 12:35:56,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:56,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:35:56,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:56,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:35:56,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:35:56,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45 [2025-02-06 12:35:56,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 100 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-06 12:35:56,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:56,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45 [2025-02-06 12:35:56,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:57,201 INFO L124 PetriNetUnfolderBase]: 345/768 cut-off events. [2025-02-06 12:35:57,201 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 12:35:57,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1361 conditions, 768 events. 345/768 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4072 event pairs, 294 based on Foata normal form. 99/840 useless extension candidates. Maximal degree in co-relation 757. Up to 564 conditions per place. [2025-02-06 12:35:57,207 INFO L140 encePairwiseOnDemand]: 40/45 looper letters, 21 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2025-02-06 12:35:57,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 124 flow [2025-02-06 12:35:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:35:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:35:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2025-02-06 12:35:57,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-02-06 12:35:57,209 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 100 flow. Second operand 2 states and 58 transitions. [2025-02-06 12:35:57,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 124 flow [2025-02-06 12:35:57,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:35:57,211 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 82 flow [2025-02-06 12:35:57,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2025-02-06 12:35:57,212 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-02-06 12:35:57,212 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 82 flow [2025-02-06 12:35:57,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-06 12:35:57,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:57,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:35:57,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:35:57,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:35:57,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1662745549, now seen corresponding path program 1 times [2025-02-06 12:35:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937359880] [2025-02-06 12:35:57,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:57,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:57,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:57,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:57,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:57,293 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-06 12:35:57,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:57,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937359880] [2025-02-06 12:35:57,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937359880] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:57,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:57,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:35:57,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975547603] [2025-02-06 12:35:57,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:57,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:57,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:57,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:57,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:57,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45 [2025-02-06 12:35:57,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-06 12:35:57,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:57,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45 [2025-02-06 12:35:57,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:57,391 INFO L124 PetriNetUnfolderBase]: 345/753 cut-off events. [2025-02-06 12:35:57,391 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-06 12:35:57,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 753 events. 345/753 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3900 event pairs, 294 based on Foata normal form. 0/741 useless extension candidates. Maximal degree in co-relation 1342. Up to 563 conditions per place. [2025-02-06 12:35:57,399 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-02-06 12:35:57,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 120 flow [2025-02-06 12:35:57,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:57,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-02-06 12:35:57,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-02-06 12:35:57,400 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 82 flow. Second operand 3 states and 65 transitions. [2025-02-06 12:35:57,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 120 flow [2025-02-06 12:35:57,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:35:57,402 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 80 flow [2025-02-06 12:35:57,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2025-02-06 12:35:57,402 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2025-02-06 12:35:57,402 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 80 flow [2025-02-06 12:35:57,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-06 12:35:57,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:57,402 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:35:57,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 12:35:57,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:35:57,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1662745548, now seen corresponding path program 1 times [2025-02-06 12:35:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921830303] [2025-02-06 12:35:57,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:57,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:57,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:57,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:57,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:57,587 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-06 12:35:57,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:57,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921830303] [2025-02-06 12:35:57,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921830303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:57,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:57,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:57,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634008108] [2025-02-06 12:35:57,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:57,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:35:57,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:57,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:35:57,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:35:57,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45 [2025-02-06 12:35:57,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:57,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:57,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45 [2025-02-06 12:35:57,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:57,906 INFO L124 PetriNetUnfolderBase]: 646/1368 cut-off events. [2025-02-06 12:35:57,906 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-06 12:35:57,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 1368 events. 646/1368 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7705 event pairs, 188 based on Foata normal form. 27/1362 useless extension candidates. Maximal degree in co-relation 2469. Up to 420 conditions per place. [2025-02-06 12:35:57,915 INFO L140 encePairwiseOnDemand]: 39/45 looper letters, 45 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2025-02-06 12:35:57,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 246 flow [2025-02-06 12:35:57,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:35:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:35:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-02-06 12:35:57,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5644444444444444 [2025-02-06 12:35:57,917 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 80 flow. Second operand 5 states and 127 transitions. [2025-02-06 12:35:57,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 246 flow [2025-02-06 12:35:57,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:35:57,919 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 106 flow [2025-02-06 12:35:57,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2025-02-06 12:35:57,920 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2025-02-06 12:35:57,920 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 106 flow [2025-02-06 12:35:57,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:35:57,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:57,921 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-06 12:35:57,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 12:35:57,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 8 more)] === [2025-02-06 12:35:57,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:57,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1604541596, now seen corresponding path program 1 times [2025-02-06 12:35:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:57,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016660619] [2025-02-06 12:35:57,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:57,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:57,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:35:57,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:35:57,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:57,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:57,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:35:57,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:35:57,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:35:57,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:57,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:35:57,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:35:57,964 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2025-02-06 12:35:57,964 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2025-02-06 12:35:57,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2025-02-06 12:35:57,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:35:57,968 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-06 12:35:57,968 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:35:57,968 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 12:35:58,004 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:35:58,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 64 transitions, 146 flow [2025-02-06 12:35:58,020 INFO L124 PetriNetUnfolderBase]: 9/78 cut-off events. [2025-02-06 12:35:58,020 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 12:35:58,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 78 events. 9/78 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 212 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 61. Up to 4 conditions per place. [2025-02-06 12:35:58,021 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 64 transitions, 146 flow [2025-02-06 12:35:58,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 64 transitions, 146 flow [2025-02-06 12:35:58,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:35:58,024 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;@6e3be946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:35:58,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-06 12:35:58,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:35:58,025 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:35:58,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:35:58,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:58,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:35:58,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:35:58,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:58,026 INFO L85 PathProgramCache]: Analyzing trace with hash 295991, now seen corresponding path program 1 times [2025-02-06 12:35:58,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:58,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377546316] [2025-02-06 12:35:58,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:58,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:58,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:35:58,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:35:58,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:58,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:58,049 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-06 12:35:58,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:58,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377546316] [2025-02-06 12:35:58,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377546316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:58,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:35:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083773072] [2025-02-06 12:35:58,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:58,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:35:58,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:58,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:35:58,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:35:58,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 64 [2025-02-06 12:35:58,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 64 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-06 12:35:58,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:58,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 64 [2025-02-06 12:35:58,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:58,673 INFO L124 PetriNetUnfolderBase]: 4505/7972 cut-off events. [2025-02-06 12:35:58,673 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-02-06 12:35:58,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14518 conditions, 7972 events. 4505/7972 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 55830 event pairs, 3878 based on Foata normal form. 1212/8917 useless extension candidates. Maximal degree in co-relation 3003. Up to 6260 conditions per place. [2025-02-06 12:35:58,714 INFO L140 encePairwiseOnDemand]: 57/64 looper letters, 30 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-02-06 12:35:58,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 182 flow [2025-02-06 12:35:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:35:58,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:35:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2025-02-06 12:35:58,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2025-02-06 12:35:58,716 INFO L175 Difference]: Start difference. First operand has 62 places, 64 transitions, 146 flow. Second operand 2 states and 83 transitions. [2025-02-06 12:35:58,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 182 flow [2025-02-06 12:35:58,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 180 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 12:35:58,718 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 120 flow [2025-02-06 12:35:58,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=56, 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=120, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2025-02-06 12:35:58,718 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2025-02-06 12:35:58,718 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 120 flow [2025-02-06 12:35:58,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-06 12:35:58,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:58,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:35:58,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 12:35:58,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:35:58,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:58,719 INFO L85 PathProgramCache]: Analyzing trace with hash 231131873, now seen corresponding path program 1 times [2025-02-06 12:35:58,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:58,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371155529] [2025-02-06 12:35:58,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:58,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:58,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:58,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:58,767 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-06 12:35:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371155529] [2025-02-06 12:35:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371155529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:58,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:35:58,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264001629] [2025-02-06 12:35:58,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:58,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:35:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:58,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:35:58,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:35:58,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 64 [2025-02-06 12:35:58,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-06 12:35:58,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:58,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 64 [2025-02-06 12:35:58,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:35:59,272 INFO L124 PetriNetUnfolderBase]: 4505/7861 cut-off events. [2025-02-06 12:35:59,273 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-02-06 12:35:59,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14344 conditions, 7861 events. 4505/7861 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 54009 event pairs, 3878 based on Foata normal form. 0/7705 useless extension candidates. Maximal degree in co-relation 14338. Up to 6259 conditions per place. [2025-02-06 12:35:59,315 INFO L140 encePairwiseOnDemand]: 60/64 looper letters, 29 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2025-02-06 12:35:59,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 174 flow [2025-02-06 12:35:59,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:35:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:35:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-02-06 12:35:59,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.484375 [2025-02-06 12:35:59,318 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 120 flow. Second operand 3 states and 93 transitions. [2025-02-06 12:35:59,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 174 flow [2025-02-06 12:35:59,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:35:59,320 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 116 flow [2025-02-06 12:35:59,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2025-02-06 12:35:59,321 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2025-02-06 12:35:59,321 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 116 flow [2025-02-06 12:35:59,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-06 12:35:59,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:35:59,321 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:35:59,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:35:59,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:35:59,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:35:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 231131874, now seen corresponding path program 1 times [2025-02-06 12:35:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:35:59,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674692684] [2025-02-06 12:35:59,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:35:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:35:59,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:35:59,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:35:59,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:35:59,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:35:59,450 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-06 12:35:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:35:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674692684] [2025-02-06 12:35:59,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674692684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:35:59,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:35:59,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:35:59,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750019095] [2025-02-06 12:35:59,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:35:59,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:35:59,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:35:59,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:35:59,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:35:59,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-02-06 12:35:59,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-06 12:35:59,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:35:59,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-02-06 12:35:59,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:00,379 INFO L124 PetriNetUnfolderBase]: 8446/14373 cut-off events. [2025-02-06 12:36:00,379 INFO L125 PetriNetUnfolderBase]: For 433/433 co-relation queries the response was YES. [2025-02-06 12:36:00,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26521 conditions, 14373 events. 8446/14373 cut-off events. For 433/433 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 104019 event pairs, 1830 based on Foata normal form. 219/14316 useless extension candidates. Maximal degree in co-relation 26514. Up to 4692 conditions per place. [2025-02-06 12:36:00,436 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 72 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-02-06 12:36:00,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 382 flow [2025-02-06 12:36:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2025-02-06 12:36:00,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.590625 [2025-02-06 12:36:00,438 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 116 flow. Second operand 5 states and 189 transitions. [2025-02-06 12:36:00,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 382 flow [2025-02-06 12:36:00,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:00,440 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 142 flow [2025-02-06 12:36:00,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-02-06 12:36:00,440 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2025-02-06 12:36:00,440 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 142 flow [2025-02-06 12:36:00,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-06 12:36:00,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:00,441 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:00,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:36:00,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:00,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:00,441 INFO L85 PathProgramCache]: Analyzing trace with hash 207975091, now seen corresponding path program 1 times [2025-02-06 12:36:00,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:00,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-02-06 12:36:00,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:00,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:00,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:00,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:00,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:00,654 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-06 12:36:00,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:00,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-02-06 12:36:00,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93646670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:00,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:00,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:00,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996848681] [2025-02-06 12:36:00,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:00,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:00,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:00,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:00,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:00,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 64 [2025-02-06 12:36:00,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-06 12:36:00,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:00,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 64 [2025-02-06 12:36:00,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:02,291 INFO L124 PetriNetUnfolderBase]: 14743/24834 cut-off events. [2025-02-06 12:36:02,291 INFO L125 PetriNetUnfolderBase]: For 5582/5948 co-relation queries the response was YES. [2025-02-06 12:36:02,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49669 conditions, 24834 events. 14743/24834 cut-off events. For 5582/5948 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 191170 event pairs, 3306 based on Foata normal form. 378/24711 useless extension candidates. Maximal degree in co-relation 49660. Up to 8148 conditions per place. [2025-02-06 12:36:02,622 INFO L140 encePairwiseOnDemand]: 58/64 looper letters, 76 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-02-06 12:36:02,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 99 transitions, 446 flow [2025-02-06 12:36:02,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-02-06 12:36:02,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584375 [2025-02-06 12:36:02,624 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 142 flow. Second operand 5 states and 187 transitions. [2025-02-06 12:36:02,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 99 transitions, 446 flow [2025-02-06 12:36:02,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 445 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:02,628 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 168 flow [2025-02-06 12:36:02,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-02-06 12:36:02,629 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2025-02-06 12:36:02,629 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 168 flow [2025-02-06 12:36:02,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 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-06 12:36:02,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:02,629 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-06 12:36:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:36:02,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 11 more)] === [2025-02-06 12:36:02,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1301494518, now seen corresponding path program 1 times [2025-02-06 12:36:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:02,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022922949] [2025-02-06 12:36:02,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:02,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:36:02,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:36:02,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:02,638 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:36:02,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 12:36:02,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 12:36:02,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:36:02,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:36:02,645 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:36:02,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 14 remaining) [2025-02-06 12:36:02,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (10 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (9 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (3 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 14 remaining) [2025-02-06 12:36:02,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2025-02-06 12:36:02,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:36:02,647 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 12:36:02,647 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 12:36:02,647 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 12:36:02,670 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 12:36:02,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 83 transitions, 194 flow [2025-02-06 12:36:02,676 INFO L124 PetriNetUnfolderBase]: 12/102 cut-off events. [2025-02-06 12:36:02,676 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 12:36:02,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 102 events. 12/102 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 306 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 90. Up to 5 conditions per place. [2025-02-06 12:36:02,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 83 transitions, 194 flow [2025-02-06 12:36:02,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 83 transitions, 194 flow [2025-02-06 12:36:02,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:36:02,678 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;@6e3be946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:36:02,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-06 12:36:02,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 12:36:02,679 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-02-06 12:36:02,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 12:36:02,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:02,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 12:36:02,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:02,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash 378410, now seen corresponding path program 1 times [2025-02-06 12:36:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029778414] [2025-02-06 12:36:02,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:02,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:36:02,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:36:02,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:02,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:02,686 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-06 12:36:02,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:02,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029778414] [2025-02-06 12:36:02,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029778414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:02,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:02,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:36:02,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373741309] [2025-02-06 12:36:02,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:02,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 12:36:02,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:02,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 12:36:02,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 12:36:02,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-02-06 12:36:02,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:02,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:02,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-02-06 12:36:02,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:06,598 INFO L124 PetriNetUnfolderBase]: 50073/77900 cut-off events. [2025-02-06 12:36:06,598 INFO L125 PetriNetUnfolderBase]: For 6570/6570 co-relation queries the response was YES. [2025-02-06 12:36:06,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144863 conditions, 77900 events. 50073/77900 cut-off events. For 6570/6570 co-relation queries the response was YES. Maximal size of possible extension queue 2504. Compared 630014 event pairs, 43302 based on Foata normal form. 13184/88884 useless extension candidates. Maximal degree in co-relation 14586. Up to 64116 conditions per place. [2025-02-06 12:36:07,006 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 39 selfloop transitions, 0 changer transitions 0/68 dead transitions. [2025-02-06 12:36:07,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 68 transitions, 242 flow [2025-02-06 12:36:07,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 12:36:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 12:36:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 108 transitions. [2025-02-06 12:36:07,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6506024096385542 [2025-02-06 12:36:07,008 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 194 flow. Second operand 2 states and 108 transitions. [2025-02-06 12:36:07,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 68 transitions, 242 flow [2025-02-06 12:36:07,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 68 transitions, 236 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:07,012 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 158 flow [2025-02-06 12:36:07,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=158, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2025-02-06 12:36:07,012 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -6 predicate places. [2025-02-06 12:36:07,012 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 158 flow [2025-02-06 12:36:07,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:36:07,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:07,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:07,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:36:07,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:07,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1607854463, now seen corresponding path program 1 times [2025-02-06 12:36:07,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:07,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980922794] [2025-02-06 12:36:07,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:07,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:07,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:07,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:07,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:07,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:07,046 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-06 12:36:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980922794] [2025-02-06 12:36:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980922794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:07,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:07,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 12:36:07,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559991203] [2025-02-06 12:36:07,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:07,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:36:07,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:07,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:36:07,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:36:07,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-02-06 12:36:07,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-06 12:36:07,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:07,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-02-06 12:36:07,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:11,926 INFO L124 PetriNetUnfolderBase]: 50073/77021 cut-off events. [2025-02-06 12:36:11,927 INFO L125 PetriNetUnfolderBase]: For 2846/2846 co-relation queries the response was YES. [2025-02-06 12:36:12,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142897 conditions, 77021 events. 50073/77021 cut-off events. For 2846/2846 co-relation queries the response was YES. Maximal size of possible extension queue 2448. Compared 610490 event pairs, 43302 based on Foata normal form. 0/75700 useless extension candidates. Maximal degree in co-relation 142890. Up to 64115 conditions per place. [2025-02-06 12:36:12,583 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 38 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-02-06 12:36:12,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 228 flow [2025-02-06 12:36:12,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:36:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 12:36:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2025-02-06 12:36:12,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4859437751004016 [2025-02-06 12:36:12,585 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 158 flow. Second operand 3 states and 121 transitions. [2025-02-06 12:36:12,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 228 flow [2025-02-06 12:36:12,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 12:36:12,592 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 152 flow [2025-02-06 12:36:12,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-02-06 12:36:12,593 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -8 predicate places. [2025-02-06 12:36:12,593 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 152 flow [2025-02-06 12:36:12,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-06 12:36:12,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:12,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:36:12,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:36:12,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:12,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:12,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1607854462, now seen corresponding path program 1 times [2025-02-06 12:36:12,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:12,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-02-06 12:36:12,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:12,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:12,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:36:12,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:36:12,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:12,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:12,721 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-06 12:36:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-02-06 12:36:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83329312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:12,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:12,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:12,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570475962] [2025-02-06 12:36:12,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:12,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:12,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:12,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:12,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-02-06 12:36:12,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-06 12:36:12,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:12,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-02-06 12:36:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 12:36:20,624 INFO L124 PetriNetUnfolderBase]: 93886/142065 cut-off events. [2025-02-06 12:36:20,628 INFO L125 PetriNetUnfolderBase]: For 3685/3685 co-relation queries the response was YES. [2025-02-06 12:36:21,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265574 conditions, 142065 events. 93886/142065 cut-off events. For 3685/3685 co-relation queries the response was YES. Maximal size of possible extension queue 3591. Compared 1171539 event pairs, 20774 based on Foata normal form. 1755/141342 useless extension candidates. Maximal degree in co-relation 265566. Up to 48084 conditions per place. [2025-02-06 12:36:21,585 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 99 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2025-02-06 12:36:21,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 128 transitions, 518 flow [2025-02-06 12:36:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:36:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 12:36:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 251 transitions. [2025-02-06 12:36:21,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6048192771084338 [2025-02-06 12:36:21,591 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 152 flow. Second operand 5 states and 251 transitions. [2025-02-06 12:36:21,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 128 transitions, 518 flow [2025-02-06 12:36:21,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 128 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 12:36:21,599 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 178 flow [2025-02-06 12:36:21,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2025-02-06 12:36:21,600 INFO L279 CegarLoopForPetriNet]: 80 programPoint places, -3 predicate places. [2025-02-06 12:36:21,603 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 178 flow [2025-02-06 12:36:21,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 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-06 12:36:21,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 12:36:21,604 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:36:21,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:36:21,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (and 14 more)] === [2025-02-06 12:36:21,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:36:21,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1037019288, now seen corresponding path program 1 times [2025-02-06 12:36:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:36:21,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722998602] [2025-02-06 12:36:21,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:36:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:36:21,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:36:21,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:36:21,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:36:21,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:36:21,750 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-06 12:36:21,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:36:21,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722998602] [2025-02-06 12:36:21,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722998602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:36:21,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:36:21,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:36:21,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071730210] [2025-02-06 12:36:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:36:21,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:36:21,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:36:21,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:36:21,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:36:21,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-02-06 12:36:21,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 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-06 12:36:21,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 12:36:21,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-02-06 12:36:21,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand