./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/stack_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:47,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:47,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:55:47,605 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:47,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:47,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:47,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:47,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:47,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:47,627 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:47,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:47,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:47,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:47,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:47,629 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:47,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:47,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:47,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:47,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:47,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:47,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:47,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:47,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:47,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:47,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:47,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:47,632 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2025-03-09 00:55:47,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:47,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:47,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:47,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:47,897 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:47,898 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2025-03-09 00:55:49,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733a77940/a494068586ee444f8e12859229b71f0f/FLAG6a54e991b [2025-03-09 00:55:49,309 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:49,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2025-03-09 00:55:49,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733a77940/a494068586ee444f8e12859229b71f0f/FLAG6a54e991b [2025-03-09 00:55:49,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/733a77940/a494068586ee444f8e12859229b71f0f [2025-03-09 00:55:49,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:49,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:49,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:49,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:49,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:49,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,639 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230547a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:49, skipping insertion in model container [2025-03-09 00:55:49,639 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:49" (1/1) ... [2025-03-09 00:55:49,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:49,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:49,936 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:49,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:50,043 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:50,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50 WrapperNode [2025-03-09 00:55:50,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:50,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:50,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:50,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:50,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,099 INFO L138 Inliner]: procedures = 277, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 550 [2025-03-09 00:55:50,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:50,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:50,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:50,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:50,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,112 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,136 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2025-03-09 00:55:50,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,158 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:50,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:50,172 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:50,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:50,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (1/1) ... [2025-03-09 00:55:50,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:50,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:50,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:55:50,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:55:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:55:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:55:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:55:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:55:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:55:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:55:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:55:50,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:50,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:50,221 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:55:50,357 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:50,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:51,015 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem38#1; [2025-03-09 00:55:51,015 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret37#1; [2025-03-09 00:55:51,015 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0; [2025-03-09 00:55:51,016 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:51,016 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:54,336 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:54,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:54,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:54 BoogieIcfgContainer [2025-03-09 00:55:54,337 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:54,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:54,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:54,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:54,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:49" (1/3) ... [2025-03-09 00:55:54,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f05b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:54, skipping insertion in model container [2025-03-09 00:55:54,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:50" (2/3) ... [2025-03-09 00:55:54,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f05b27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:54, skipping insertion in model container [2025-03-09 00:55:54,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:54" (3/3) ... [2025-03-09 00:55:54,345 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-03-09 00:55:54,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:54,365 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-09 00:55:54,365 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:54,425 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 00:55:54,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:55:54,492 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-03-09 00:55:54,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:55:54,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2025-03-09 00:55:54,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:55:54,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-03-09 00:55:54,513 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:54,524 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;@2dd29dd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:54,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:55:54,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:54,546 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-09 00:55:54,546 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:55:54,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:54,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:54,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash -604214011, now seen corresponding path program 1 times [2025-03-09 00:55:54,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:54,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046659245] [2025-03-09 00:55:54,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:54,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:54,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:54,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:54,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:54,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:55,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:55,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:55,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046659245] [2025-03-09 00:55:55,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046659245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:55,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:55,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690780411] [2025-03-09 00:55:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:55,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:55,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:55,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:55,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:55,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:55,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:55,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:55,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:55,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:55,428 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2025-03-09 00:55:55,429 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 00:55:55,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4519 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2025-03-09 00:55:55,437 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-09 00:55:55,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-03-09 00:55:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 00:55:55,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-09 00:55:55,449 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-03-09 00:55:55,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-03-09 00:55:55,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:55:55,457 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-03-09 00:55:55,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-09 00:55:55,461 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-09 00:55:55,462 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-03-09 00:55:55,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:55,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:55,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:55,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:55:55,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:55,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:55,463 INFO L85 PathProgramCache]: Analyzing trace with hash -604214010, now seen corresponding path program 1 times [2025-03-09 00:55:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367132425] [2025-03-09 00:55:55,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:55,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:55,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:55,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:55,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:55,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:55,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367132425] [2025-03-09 00:55:55,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367132425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:55,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:55,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:55,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531593417] [2025-03-09 00:55:55,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:55,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:55,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:55,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:55,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:55,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:55,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:55,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:55,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:55,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:56,284 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2025-03-09 00:55:56,285 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 00:55:56,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7421 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2025-03-09 00:55:56,293 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-09 00:55:56,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-03-09 00:55:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:55:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:55:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-09 00:55:56,295 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-03-09 00:55:56,295 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-03-09 00:55:56,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-03-09 00:55:56,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:55:56,299 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-03-09 00:55:56,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-09 00:55:56,300 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-09 00:55:56,300 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-03-09 00:55:56,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:56,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:56,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:55:56,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:56,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1606378108, now seen corresponding path program 1 times [2025-03-09 00:55:56,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:56,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622372977] [2025-03-09 00:55:56,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:56,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:56,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:55:56,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:55:56,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:56,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:56,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:56,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622372977] [2025-03-09 00:55:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622372977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:56,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:56,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169565928] [2025-03-09 00:55:56,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:56,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:56,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:56,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:56,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:56,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:56,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:56,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:56,693 INFO L124 PetriNetUnfolderBase]: 663/1274 cut-off events. [2025-03-09 00:55:56,693 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2025-03-09 00:55:56,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1274 events. 663/1274 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6557 event pairs, 176 based on Foata normal form. 34/1197 useless extension candidates. Maximal degree in co-relation 2591. Up to 721 conditions per place. [2025-03-09 00:55:56,700 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 67 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-03-09 00:55:56,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 87 transitions, 376 flow [2025-03-09 00:55:56,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-03-09 00:55:56,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-03-09 00:55:56,703 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 5 states and 160 transitions. [2025-03-09 00:55:56,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 87 transitions, 376 flow [2025-03-09 00:55:56,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:56,706 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 161 flow [2025-03-09 00:55:56,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-09 00:55:56,706 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2025-03-09 00:55:56,706 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 161 flow [2025-03-09 00:55:56,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:56,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:56,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:55:56,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:56,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:56,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2138198452, now seen corresponding path program 1 times [2025-03-09 00:55:56,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765363809] [2025-03-09 00:55:56,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:56,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:55:56,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:55:56,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:56,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:56,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:56,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765363809] [2025-03-09 00:55:56,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765363809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:56,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:56,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:56,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76013556] [2025-03-09 00:55:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:56,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:56,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:56,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:56,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:56,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:56,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:56,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:56,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:57,102 INFO L124 PetriNetUnfolderBase]: 971/1835 cut-off events. [2025-03-09 00:55:57,102 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2025-03-09 00:55:57,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4026 conditions, 1835 events. 971/1835 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 9713 event pairs, 464 based on Foata normal form. 0/1713 useless extension candidates. Maximal degree in co-relation 3355. Up to 1051 conditions per place. [2025-03-09 00:55:57,118 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 73 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-09 00:55:57,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 429 flow [2025-03-09 00:55:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-03-09 00:55:57,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-03-09 00:55:57,120 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 161 flow. Second operand 4 states and 139 transitions. [2025-03-09 00:55:57,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 429 flow [2025-03-09 00:55:57,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 93 transitions, 429 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:57,127 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 197 flow [2025-03-09 00:55:57,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2025-03-09 00:55:57,128 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2025-03-09 00:55:57,128 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 197 flow [2025-03-09 00:55:57,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:57,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:57,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:57,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:55:57,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:57,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1562818447, now seen corresponding path program 1 times [2025-03-09 00:55:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979799909] [2025-03-09 00:55:57,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:57,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:55:57,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:55:57,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:57,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:57,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:57,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:57,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979799909] [2025-03-09 00:55:57,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979799909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:57,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:57,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197403094] [2025-03-09 00:55:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:57,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:57,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:57,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:57,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:55:57,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-03-09 00:55:57,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:57,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:55:57,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:57,372 INFO L124 PetriNetUnfolderBase]: 1096/2029 cut-off events. [2025-03-09 00:55:57,373 INFO L125 PetriNetUnfolderBase]: For 579/579 co-relation queries the response was YES. [2025-03-09 00:55:57,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4873 conditions, 2029 events. 1096/2029 cut-off events. For 579/579 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10865 event pairs, 514 based on Foata normal form. 22/1932 useless extension candidates. Maximal degree in co-relation 4011. Up to 1284 conditions per place. [2025-03-09 00:55:57,383 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 62 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2025-03-09 00:55:57,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 397 flow [2025-03-09 00:55:57,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:57,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:57,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-09 00:55:57,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6424242424242425 [2025-03-09 00:55:57,384 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 197 flow. Second operand 3 states and 106 transitions. [2025-03-09 00:55:57,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 397 flow [2025-03-09 00:55:57,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 391 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:57,389 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 203 flow [2025-03-09 00:55:57,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2025-03-09 00:55:57,389 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2025-03-09 00:55:57,389 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 203 flow [2025-03-09 00:55:57,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 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-03-09 00:55:57,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:57,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:57,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:55:57,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:57,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:57,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1086820866, now seen corresponding path program 1 times [2025-03-09 00:55:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743112939] [2025-03-09 00:55:57,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:57,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:57,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 00:55:57,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 00:55:57,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:57,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:57,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:57,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743112939] [2025-03-09 00:55:57,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743112939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:57,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:57,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392439130] [2025-03-09 00:55:57,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:57,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:57,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:57,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:57,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:57,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:57,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:57,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:57,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:57,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:57,641 INFO L124 PetriNetUnfolderBase]: 1006/1857 cut-off events. [2025-03-09 00:55:57,641 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2025-03-09 00:55:57,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 1857 events. 1006/1857 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9908 event pairs, 361 based on Foata normal form. 14/1753 useless extension candidates. Maximal degree in co-relation 3872. Up to 1410 conditions per place. [2025-03-09 00:55:57,651 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 49 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2025-03-09 00:55:57,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 313 flow [2025-03-09 00:55:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2025-03-09 00:55:57,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2025-03-09 00:55:57,652 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 203 flow. Second operand 3 states and 96 transitions. [2025-03-09 00:55:57,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 313 flow [2025-03-09 00:55:57,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 303 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 00:55:57,655 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 180 flow [2025-03-09 00:55:57,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-03-09 00:55:57,658 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2025-03-09 00:55:57,658 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 180 flow [2025-03-09 00:55:57,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:57,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:57,658 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:57,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:55:57,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:55:57,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:57,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1068464610, now seen corresponding path program 1 times [2025-03-09 00:55:57,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:57,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482482811] [2025-03-09 00:55:57,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:57,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:57,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:55:57,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:55:57,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:57,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:58,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482482811] [2025-03-09 00:55:58,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482482811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:55:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881164069] [2025-03-09 00:55:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:55:58,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:58,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:55:58,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:55:58,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:55:58,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:55:58,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:58,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:58,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 00:55:58,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:55:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:58,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:55:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881164069] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:55:58,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:55:58,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2025-03-09 00:55:58,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559285777] [2025-03-09 00:55:58,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:55:58,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 00:55:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:58,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 00:55:58,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-09 00:55:58,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:55:58,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 180 flow. Second operand has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:58,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:58,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:55:58,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:59,838 INFO L124 PetriNetUnfolderBase]: 4128/7722 cut-off events. [2025-03-09 00:55:59,838 INFO L125 PetriNetUnfolderBase]: For 2485/2485 co-relation queries the response was YES. [2025-03-09 00:55:59,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17864 conditions, 7722 events. 4128/7722 cut-off events. For 2485/2485 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 50435 event pairs, 309 based on Foata normal form. 192/7404 useless extension candidates. Maximal degree in co-relation 7413. Up to 1423 conditions per place. [2025-03-09 00:55:59,887 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 327 selfloop transitions, 45 changer transitions 0/386 dead transitions. [2025-03-09 00:55:59,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 386 transitions, 1892 flow [2025-03-09 00:55:59,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:55:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 00:55:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 685 transitions. [2025-03-09 00:55:59,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2025-03-09 00:55:59,889 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 180 flow. Second operand 20 states and 685 transitions. [2025-03-09 00:55:59,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 386 transitions, 1892 flow [2025-03-09 00:55:59,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 386 transitions, 1850 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:59,898 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 592 flow [2025-03-09 00:55:59,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=592, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2025-03-09 00:55:59,899 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 42 predicate places. [2025-03-09 00:55:59,899 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 592 flow [2025-03-09 00:55:59,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 19.0) internal successors, (285), 15 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:59,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:59,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:59,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 00:56:00,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:00,100 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:00,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:00,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1486767657, now seen corresponding path program 1 times [2025-03-09 00:56:00,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:00,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159534084] [2025-03-09 00:56:00,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:00,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:00,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:56:00,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:56:00,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:00,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:00,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:00,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159534084] [2025-03-09 00:56:00,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159534084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:00,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:00,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:56:00,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314988651] [2025-03-09 00:56:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:00,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:00,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:00,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:00,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:00,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:00,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:00,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:00,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:00,523 INFO L124 PetriNetUnfolderBase]: 1833/3828 cut-off events. [2025-03-09 00:56:00,523 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2025-03-09 00:56:00,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9379 conditions, 3828 events. 1833/3828 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 22294 event pairs, 372 based on Foata normal form. 234/3906 useless extension candidates. Maximal degree in co-relation 9177. Up to 2311 conditions per place. [2025-03-09 00:56:00,545 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 70 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-03-09 00:56:00,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 89 transitions, 609 flow [2025-03-09 00:56:00,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2025-03-09 00:56:00,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5696969696969697 [2025-03-09 00:56:00,546 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 592 flow. Second operand 3 states and 94 transitions. [2025-03-09 00:56:00,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 89 transitions, 609 flow [2025-03-09 00:56:00,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 561 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-03-09 00:56:00,555 INFO L231 Difference]: Finished difference. Result has 83 places, 78 transitions, 389 flow [2025-03-09 00:56:00,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2025-03-09 00:56:00,556 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2025-03-09 00:56:00,556 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 389 flow [2025-03-09 00:56:00,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:00,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:00,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:00,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:56:00,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:00,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:00,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1170798616, now seen corresponding path program 1 times [2025-03-09 00:56:00,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:00,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346680858] [2025-03-09 00:56:00,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:00,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:56:00,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:56:00,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:00,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:00,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:00,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346680858] [2025-03-09 00:56:00,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346680858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:00,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139177127] [2025-03-09 00:56:00,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:00,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:00,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:00,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:00,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:00,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:00,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-03-09 00:56:00,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:00,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:00,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:01,025 INFO L124 PetriNetUnfolderBase]: 1838/3730 cut-off events. [2025-03-09 00:56:01,025 INFO L125 PetriNetUnfolderBase]: For 1489/1489 co-relation queries the response was YES. [2025-03-09 00:56:01,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9363 conditions, 3730 events. 1838/3730 cut-off events. For 1489/1489 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21406 event pairs, 1214 based on Foata normal form. 0/3605 useless extension candidates. Maximal degree in co-relation 7894. Up to 2670 conditions per place. [2025-03-09 00:56:01,040 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 65 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-03-09 00:56:01,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 82 transitions, 540 flow [2025-03-09 00:56:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:01,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:01,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2025-03-09 00:56:01,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2025-03-09 00:56:01,042 INFO L175 Difference]: Start difference. First operand has 83 places, 78 transitions, 389 flow. Second operand 4 states and 100 transitions. [2025-03-09 00:56:01,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 82 transitions, 540 flow [2025-03-09 00:56:01,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 82 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:01,047 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 389 flow [2025-03-09 00:56:01,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2025-03-09 00:56:01,048 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 34 predicate places. [2025-03-09 00:56:01,048 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 389 flow [2025-03-09 00:56:01,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 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-03-09 00:56:01,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:01,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:56:01,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:01,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:01,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1942171851, now seen corresponding path program 1 times [2025-03-09 00:56:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847305892] [2025-03-09 00:56:01,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:01,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:56:01,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:56:01,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:01,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:01,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:01,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847305892] [2025-03-09 00:56:01,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847305892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:01,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:01,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 00:56:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329176184] [2025-03-09 00:56:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:01,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 00:56:01,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:01,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 00:56:01,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 00:56:01,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:01,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:01,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:01,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:01,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:01,782 INFO L124 PetriNetUnfolderBase]: 1961/3997 cut-off events. [2025-03-09 00:56:01,782 INFO L125 PetriNetUnfolderBase]: For 1679/1679 co-relation queries the response was YES. [2025-03-09 00:56:01,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9865 conditions, 3997 events. 1961/3997 cut-off events. For 1679/1679 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 23159 event pairs, 461 based on Foata normal form. 0/3837 useless extension candidates. Maximal degree in co-relation 8395. Up to 2936 conditions per place. [2025-03-09 00:56:01,802 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 105 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2025-03-09 00:56:01,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 126 transitions, 772 flow [2025-03-09 00:56:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 00:56:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 00:56:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-03-09 00:56:01,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2025-03-09 00:56:01,804 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 389 flow. Second operand 7 states and 197 transitions. [2025-03-09 00:56:01,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 126 transitions, 772 flow [2025-03-09 00:56:01,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 126 transitions, 762 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:01,811 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 440 flow [2025-03-09 00:56:01,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-03-09 00:56:01,813 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-03-09 00:56:01,813 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 440 flow [2025-03-09 00:56:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:01,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:01,813 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:01,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:56:01,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:01,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash -844659777, now seen corresponding path program 1 times [2025-03-09 00:56:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:01,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090244665] [2025-03-09 00:56:01,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:01,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 00:56:01,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 00:56:01,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:01,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:01,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090244665] [2025-03-09 00:56:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090244665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:01,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:01,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:56:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288595788] [2025-03-09 00:56:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:01,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:01,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:01,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:01,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:01,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:01,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:01,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:01,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:02,367 INFO L124 PetriNetUnfolderBase]: 2879/6069 cut-off events. [2025-03-09 00:56:02,367 INFO L125 PetriNetUnfolderBase]: For 3094/3094 co-relation queries the response was YES. [2025-03-09 00:56:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15013 conditions, 6069 events. 2879/6069 cut-off events. For 3094/3094 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40477 event pairs, 1373 based on Foata normal form. 137/5984 useless extension candidates. Maximal degree in co-relation 12986. Up to 3403 conditions per place. [2025-03-09 00:56:02,393 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 124 selfloop transitions, 2 changer transitions 0/140 dead transitions. [2025-03-09 00:56:02,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 140 transitions, 1050 flow [2025-03-09 00:56:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:02,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:02,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-09 00:56:02,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2025-03-09 00:56:02,394 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 440 flow. Second operand 3 states and 107 transitions. [2025-03-09 00:56:02,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 140 transitions, 1050 flow [2025-03-09 00:56:02,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:02,406 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 445 flow [2025-03-09 00:56:02,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2025-03-09 00:56:02,407 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2025-03-09 00:56:02,407 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 445 flow [2025-03-09 00:56:02,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:02,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:02,407 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:02,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:56:02,407 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:02,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:02,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1222957098, now seen corresponding path program 1 times [2025-03-09 00:56:02,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:02,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334472796] [2025-03-09 00:56:02,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:02,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 00:56:02,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:56:02,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:02,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:02,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:02,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:02,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334472796] [2025-03-09 00:56:02,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334472796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:02,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:02,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:02,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79674721] [2025-03-09 00:56:02,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:02,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:56:02,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:02,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:56:02,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:56:02,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:02,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 445 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:02,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:02,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:02,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:03,150 INFO L124 PetriNetUnfolderBase]: 3194/6480 cut-off events. [2025-03-09 00:56:03,151 INFO L125 PetriNetUnfolderBase]: For 4317/4317 co-relation queries the response was YES. [2025-03-09 00:56:03,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17913 conditions, 6480 events. 3194/6480 cut-off events. For 4317/4317 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 42355 event pairs, 475 based on Foata normal form. 105/6399 useless extension candidates. Maximal degree in co-relation 14833. Up to 2632 conditions per place. [2025-03-09 00:56:03,199 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 109 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2025-03-09 00:56:03,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 133 transitions, 930 flow [2025-03-09 00:56:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:56:03,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:56:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-03-09 00:56:03,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2025-03-09 00:56:03,202 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 445 flow. Second operand 5 states and 152 transitions. [2025-03-09 00:56:03,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 133 transitions, 930 flow [2025-03-09 00:56:03,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 133 transitions, 923 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:03,221 INFO L231 Difference]: Finished difference. Result has 96 places, 88 transitions, 519 flow [2025-03-09 00:56:03,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=519, PETRI_PLACES=96, PETRI_TRANSITIONS=88} [2025-03-09 00:56:03,222 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 46 predicate places. [2025-03-09 00:56:03,223 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 88 transitions, 519 flow [2025-03-09 00:56:03,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:03,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:03,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:03,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:56:03,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:03,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1944139375, now seen corresponding path program 1 times [2025-03-09 00:56:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:03,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24203952] [2025-03-09 00:56:03,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:03,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:03,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 00:56:03,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 00:56:03,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:03,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:04,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24203952] [2025-03-09 00:56:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24203952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:56:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677137174] [2025-03-09 00:56:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:56:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:04,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:56:04,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:56:04,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:04,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 519 flow. Second operand has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:04,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:04,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:04,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:05,405 INFO L124 PetriNetUnfolderBase]: 4726/9647 cut-off events. [2025-03-09 00:56:05,405 INFO L125 PetriNetUnfolderBase]: For 8701/8701 co-relation queries the response was YES. [2025-03-09 00:56:05,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26984 conditions, 9647 events. 4726/9647 cut-off events. For 8701/8701 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 67193 event pairs, 1022 based on Foata normal form. 24/9453 useless extension candidates. Maximal degree in co-relation 21479. Up to 4678 conditions per place. [2025-03-09 00:56:05,448 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 187 selfloop transitions, 25 changer transitions 0/226 dead transitions. [2025-03-09 00:56:05,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 1602 flow [2025-03-09 00:56:05,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 00:56:05,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 00:56:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 339 transitions. [2025-03-09 00:56:05,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2025-03-09 00:56:05,450 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 519 flow. Second operand 12 states and 339 transitions. [2025-03-09 00:56:05,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 1602 flow [2025-03-09 00:56:05,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 226 transitions, 1600 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:05,482 INFO L231 Difference]: Finished difference. Result has 112 places, 105 transitions, 735 flow [2025-03-09 00:56:05,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=735, PETRI_PLACES=112, PETRI_TRANSITIONS=105} [2025-03-09 00:56:05,482 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2025-03-09 00:56:05,482 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 105 transitions, 735 flow [2025-03-09 00:56:05,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.9) internal successors, (189), 10 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:05,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:05,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:56:05,483 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:05,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -49076563, now seen corresponding path program 1 times [2025-03-09 00:56:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524567550] [2025-03-09 00:56:05,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:05,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 00:56:05,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 00:56:05,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:05,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:05,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:05,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524567550] [2025-03-09 00:56:05,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524567550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:05,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:05,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:05,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874103883] [2025-03-09 00:56:05,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:05,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:05,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:05,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:05,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:05,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 105 transitions, 735 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:05,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:05,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:05,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:06,685 INFO L124 PetriNetUnfolderBase]: 6719/14114 cut-off events. [2025-03-09 00:56:06,686 INFO L125 PetriNetUnfolderBase]: For 17881/17881 co-relation queries the response was YES. [2025-03-09 00:56:06,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40969 conditions, 14114 events. 6719/14114 cut-off events. For 17881/17881 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 111126 event pairs, 2587 based on Foata normal form. 409/14196 useless extension candidates. Maximal degree in co-relation 33135. Up to 6552 conditions per place. [2025-03-09 00:56:06,782 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 222 selfloop transitions, 3 changer transitions 0/239 dead transitions. [2025-03-09 00:56:06,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 239 transitions, 2212 flow [2025-03-09 00:56:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:06,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2025-03-09 00:56:06,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6681818181818182 [2025-03-09 00:56:06,783 INFO L175 Difference]: Start difference. First operand has 112 places, 105 transitions, 735 flow. Second operand 4 states and 147 transitions. [2025-03-09 00:56:06,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 239 transitions, 2212 flow [2025-03-09 00:56:06,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 239 transitions, 2166 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-03-09 00:56:06,839 INFO L231 Difference]: Finished difference. Result has 112 places, 106 transitions, 731 flow [2025-03-09 00:56:06,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=731, PETRI_PLACES=112, PETRI_TRANSITIONS=106} [2025-03-09 00:56:06,840 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 62 predicate places. [2025-03-09 00:56:06,840 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 106 transitions, 731 flow [2025-03-09 00:56:06,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:06,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:06,841 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:06,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:56:06,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:06,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1742419921, now seen corresponding path program 1 times [2025-03-09 00:56:06,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:06,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7804365] [2025-03-09 00:56:06,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:06,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:06,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:06,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:06,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:06,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:07,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:07,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7804365] [2025-03-09 00:56:07,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7804365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:07,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341756209] [2025-03-09 00:56:07,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:07,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:07,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:07,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:07,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:56:07,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:07,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:07,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:07,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:07,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 00:56:07,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:07,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:07,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:07,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341756209] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:07,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:07,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-03-09 00:56:07,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754686679] [2025-03-09 00:56:07,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:07,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 00:56:07,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:07,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 00:56:07,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-09 00:56:07,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:07,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 106 transitions, 731 flow. Second operand has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:07,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:07,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:07,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:11,185 INFO L124 PetriNetUnfolderBase]: 14081/28817 cut-off events. [2025-03-09 00:56:11,185 INFO L125 PetriNetUnfolderBase]: For 45199/45199 co-relation queries the response was YES. [2025-03-09 00:56:11,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89419 conditions, 28817 events. 14081/28817 cut-off events. For 45199/45199 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 241118 event pairs, 2136 based on Foata normal form. 268/28346 useless extension candidates. Maximal degree in co-relation 52748. Up to 4582 conditions per place. [2025-03-09 00:56:11,346 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 383 selfloop transitions, 94 changer transitions 0/490 dead transitions. [2025-03-09 00:56:11,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 490 transitions, 3889 flow [2025-03-09 00:56:11,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 00:56:11,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 00:56:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 670 transitions. [2025-03-09 00:56:11,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5537190082644629 [2025-03-09 00:56:11,348 INFO L175 Difference]: Start difference. First operand has 112 places, 106 transitions, 731 flow. Second operand 22 states and 670 transitions. [2025-03-09 00:56:11,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 490 transitions, 3889 flow [2025-03-09 00:56:11,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 490 transitions, 3822 flow, removed 13 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:11,471 INFO L231 Difference]: Finished difference. Result has 147 places, 172 transitions, 1686 flow [2025-03-09 00:56:11,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1686, PETRI_PLACES=147, PETRI_TRANSITIONS=172} [2025-03-09 00:56:11,472 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 97 predicate places. [2025-03-09 00:56:11,472 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 172 transitions, 1686 flow [2025-03-09 00:56:11,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.94736842105263) internal successors, (379), 19 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:11,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:11,473 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:11,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 00:56:11,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 00:56:11,673 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:11,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:11,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1639701864, now seen corresponding path program 1 times [2025-03-09 00:56:11,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:11,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297241497] [2025-03-09 00:56:11,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:11,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:11,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:11,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:11,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:11,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:11,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297241497] [2025-03-09 00:56:11,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297241497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 00:56:11,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874165353] [2025-03-09 00:56:11,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:11,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:11,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:11,853 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:11,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:56:11,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:12,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:12,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:12,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:12,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 00:56:12,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:12,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:12,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874165353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:12,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 00:56:12,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2025-03-09 00:56:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561137343] [2025-03-09 00:56:12,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:12,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:56:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:12,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:56:12,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:56:12,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:12,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 172 transitions, 1686 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:12,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:12,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:12,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:15,538 INFO L124 PetriNetUnfolderBase]: 12530/25890 cut-off events. [2025-03-09 00:56:15,539 INFO L125 PetriNetUnfolderBase]: For 63995/63995 co-relation queries the response was YES. [2025-03-09 00:56:15,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85521 conditions, 25890 events. 12530/25890 cut-off events. For 63995/63995 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 208853 event pairs, 3718 based on Foata normal form. 21/25244 useless extension candidates. Maximal degree in co-relation 81392. Up to 19270 conditions per place. [2025-03-09 00:56:15,847 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 181 selfloop transitions, 15 changer transitions 0/210 dead transitions. [2025-03-09 00:56:15,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 210 transitions, 2153 flow [2025-03-09 00:56:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:56:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:56:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2025-03-09 00:56:15,849 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5727272727272728 [2025-03-09 00:56:15,849 INFO L175 Difference]: Start difference. First operand has 147 places, 172 transitions, 1686 flow. Second operand 6 states and 189 transitions. [2025-03-09 00:56:15,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 210 transitions, 2153 flow [2025-03-09 00:56:16,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 210 transitions, 2052 flow, removed 46 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:16,145 INFO L231 Difference]: Finished difference. Result has 152 places, 158 transitions, 1492 flow [2025-03-09 00:56:16,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=152, PETRI_TRANSITIONS=158} [2025-03-09 00:56:16,146 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 102 predicate places. [2025-03-09 00:56:16,146 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 158 transitions, 1492 flow [2025-03-09 00:56:16,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:16,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:16,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:16,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:16,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:16,348 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:16,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:16,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1524496957, now seen corresponding path program 1 times [2025-03-09 00:56:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144003556] [2025-03-09 00:56:16,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:16,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:16,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:16,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:16,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:56:16,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:56:16,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:16,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:16,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:16,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:56:16,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:56:16,495 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:56:16,496 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-09 00:56:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:56:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-09 00:56:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-09 00:56:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:56:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:56:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-09 00:56:16,497 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:56:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:56:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-09 00:56:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:56:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-09 00:56:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-09 00:56:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-09 00:56:16,498 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-09 00:56:16,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 00:56:16,498 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:16,551 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:56:16,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:56:16,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:56:16 BasicIcfg [2025-03-09 00:56:16,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:56:16,559 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:56:16,559 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:56:16,559 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:56:16,560 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:54" (3/4) ... [2025-03-09 00:56:16,561 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:56:16,562 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:56:16,562 INFO L158 Benchmark]: Toolchain (without parser) took 26927.62ms. Allocated memory was 142.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 109.5MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-09 00:56:16,563 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:16,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.77ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 76.2MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 00:56:16,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.29ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 70.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:56:16,563 INFO L158 Benchmark]: Boogie Preprocessor took 68.52ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 66.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:16,564 INFO L158 Benchmark]: IcfgBuilder took 4165.61ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 66.0MB in the beginning and 875.8MB in the end (delta: -809.8MB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. [2025-03-09 00:56:16,564 INFO L158 Benchmark]: TraceAbstraction took 22218.13ms. Allocated memory was 1.2GB in the beginning and 3.4GB in the end (delta: 2.2GB). Free memory was 875.8MB in the beginning and 2.4GB in the end (delta: -1.5GB). Peak memory consumption was 686.2MB. Max. memory is 16.1GB. [2025-03-09 00:56:16,565 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 3.4GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:56:16,566 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.77ms. Allocated memory is still 142.6MB. Free memory was 109.5MB in the beginning and 76.2MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.29ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 70.9MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.52ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 66.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 4165.61ms. Allocated memory was 142.6MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 66.0MB in the beginning and 875.8MB in the end (delta: -809.8MB). Peak memory consumption was 346.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22218.13ms. Allocated memory was 1.2GB in the beginning and 3.4GB in the end (delta: 2.2GB). Free memory was 875.8MB in the beginning and 2.4GB in the end (delta: -1.5GB). Peak memory consumption was 686.2MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 3.4GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=399, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=399] [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=1] [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack_longer-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1017]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 102 edges, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.1s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1553 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1504 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4620 IncrementalHoareTripleChecker+Invalid, 4661 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 1 mSDtfsCounter, 4620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1686occurred in iteration=15, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 423 NumberOfCodeBlocks, 423 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 447 ConstructedInterpolants, 0 QuantifiedInterpolants, 3823 SizeOfPredicates, 14 NumberOfNonLiveVariables, 3033 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 3/57 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 00:56:16,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:56:18,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:56:18,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2025-03-09 00:56:18,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:56:18,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:56:18,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:56:18,927 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:56:18,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:56:18,928 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:56:18,928 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:56:18,928 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:56:18,928 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:56:18,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:56:18,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:56:18,928 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:56:18,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:56:18,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:56:18,930 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 00:56:18,930 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 00:56:18,930 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:56:18,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:56:18,930 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:56:18,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:56:18,930 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:18,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:56:18,931 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2025-03-09 00:56:19,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:56:19,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:56:19,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:56:19,225 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:56:19,225 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:56:19,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/stack_longer-1.i [2025-03-09 00:56:20,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3211edf34/e6c9a20743a74445b3dfc36bed3cea80/FLAG654468d79 [2025-03-09 00:56:20,795 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:56:20,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2025-03-09 00:56:20,814 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3211edf34/e6c9a20743a74445b3dfc36bed3cea80/FLAG654468d79 [2025-03-09 00:56:20,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3211edf34/e6c9a20743a74445b3dfc36bed3cea80 [2025-03-09 00:56:20,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:56:20,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:56:20,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:20,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:56:20,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:56:20,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:20" (1/1) ... [2025-03-09 00:56:20,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318f208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:20, skipping insertion in model container [2025-03-09 00:56:20,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:56:20" (1/1) ... [2025-03-09 00:56:20,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:56:21,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:21,220 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:56:21,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:56:21,375 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:56:21,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21 WrapperNode [2025-03-09 00:56:21,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:56:21,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:21,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:56:21,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:56:21,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,470 INFO L138 Inliner]: procedures = 281, calls = 432, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 546 [2025-03-09 00:56:21,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:56:21,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:56:21,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:56:21,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:56:21,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,515 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2025-03-09 00:56:21,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:56:21,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:56:21,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:56:21,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:56:21,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (1/1) ... [2025-03-09 00:56:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:56:21,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:21,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:56:21,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:56:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 00:56:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 00:56:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-09 00:56:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 00:56:21,604 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 00:56:21,604 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 00:56:21,605 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:56:21,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:56:21,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:56:21,607 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:56:21,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:56:21,747 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:56:22,626 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L982: havoc pop_#t~mem38#1; [2025-03-09 00:56:22,627 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L982-1: havoc pop_#t~ret37#1; [2025-03-09 00:56:22,627 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L984-1: pop_#res#1 := 0bv32; [2025-03-09 00:56:22,628 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:56:22,629 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:56:28,358 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:56:28,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:56:28,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:28 BoogieIcfgContainer [2025-03-09 00:56:28,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:56:28,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:56:28,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:56:28,365 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:56:28,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:56:20" (1/3) ... [2025-03-09 00:56:28,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c9fce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:28, skipping insertion in model container [2025-03-09 00:56:28,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:56:21" (2/3) ... [2025-03-09 00:56:28,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c9fce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:56:28, skipping insertion in model container [2025-03-09 00:56:28,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:28" (3/3) ... [2025-03-09 00:56:28,369 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2025-03-09 00:56:28,380 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:56:28,381 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-1.i that has 3 procedures, 47 locations, 1 initial locations, 2 loop locations, and 7 error locations. [2025-03-09 00:56:28,381 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:56:28,453 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 00:56:28,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:56:28,524 INFO L124 PetriNetUnfolderBase]: 9/53 cut-off events. [2025-03-09 00:56:28,527 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:56:28,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 53 events. 9/53 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 48. Up to 3 conditions per place. [2025-03-09 00:56:28,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 55 transitions, 124 flow [2025-03-09 00:56:28,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 52 transitions, 116 flow [2025-03-09 00:56:28,543 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:56:28,553 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;@7d80afdc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:56:28,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:56:28,574 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:56:28,574 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-03-09 00:56:28,574 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 00:56:28,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:28,575 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:28,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:28,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:28,580 INFO L85 PathProgramCache]: Analyzing trace with hash -408557307, now seen corresponding path program 1 times [2025-03-09 00:56:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450328560] [2025-03-09 00:56:28,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:28,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:28,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:28,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:28,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 00:56:28,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:56:29,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:56:29,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:29,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:29,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:56:29,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:29,151 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:29,151 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:29,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450328560] [2025-03-09 00:56:29,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450328560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:29,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:29,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:29,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019658866] [2025-03-09 00:56:29,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:29,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:29,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:29,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:29,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:29,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:29,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:29,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:29,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:29,516 INFO L124 PetriNetUnfolderBase]: 454/883 cut-off events. [2025-03-09 00:56:29,516 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-09 00:56:29,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 883 events. 454/883 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4539 event pairs, 242 based on Foata normal form. 90/851 useless extension candidates. Maximal degree in co-relation 1570. Up to 512 conditions per place. [2025-03-09 00:56:29,523 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 43 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-09 00:56:29,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 227 flow [2025-03-09 00:56:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:29,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-09 00:56:29,536 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-09 00:56:29,537 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 116 flow. Second operand 4 states and 117 transitions. [2025-03-09 00:56:29,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 227 flow [2025-03-09 00:56:29,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 217 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:56:29,546 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 100 flow [2025-03-09 00:56:29,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-09 00:56:29,552 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2025-03-09 00:56:29,553 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 100 flow [2025-03-09 00:56:29,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:29,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:29,553 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:29,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:29,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:29,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:29,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash -408557306, now seen corresponding path program 1 times [2025-03-09 00:56:29,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:29,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360692930] [2025-03-09 00:56:29,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:29,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:29,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:29,764 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:29,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 00:56:29,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:56:30,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:56:30,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:30,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:30,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 00:56:30,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:30,351 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:30,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360692930] [2025-03-09 00:56:30,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360692930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:30,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:30,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:56:30,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967512368] [2025-03-09 00:56:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:30,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:56:30,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:30,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:56:30,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:56:30,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:30,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:30,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:30,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:30,831 INFO L124 PetriNetUnfolderBase]: 750/1388 cut-off events. [2025-03-09 00:56:30,831 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 00:56:30,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 1388 events. 750/1388 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7425 event pairs, 125 based on Foata normal form. 0/1220 useless extension candidates. Maximal degree in co-relation 807. Up to 848 conditions per place. [2025-03-09 00:56:30,839 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 87 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2025-03-09 00:56:30,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 108 transitions, 423 flow [2025-03-09 00:56:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:56:30,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:56:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-03-09 00:56:30,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-03-09 00:56:30,841 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 100 flow. Second operand 6 states and 194 transitions. [2025-03-09 00:56:30,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 108 transitions, 423 flow [2025-03-09 00:56:30,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 108 transitions, 415 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:30,843 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 153 flow [2025-03-09 00:56:30,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-09 00:56:30,844 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2025-03-09 00:56:30,844 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 153 flow [2025-03-09 00:56:30,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:30,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:30,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:30,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:31,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2144618356, now seen corresponding path program 1 times [2025-03-09 00:56:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:31,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861312985] [2025-03-09 00:56:31,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:31,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:31,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:31,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:31,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 00:56:31,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:56:31,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:56:31,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:31,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:31,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:56:31,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:31,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:31,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:31,433 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:31,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861312985] [2025-03-09 00:56:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861312985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:31,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:31,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:31,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931132598] [2025-03-09 00:56:31,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:31,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:31,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:31,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:31,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:31,437 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2025-03-09 00:56:31,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:31,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:31,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2025-03-09 00:56:31,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:31,674 INFO L124 PetriNetUnfolderBase]: 793/1531 cut-off events. [2025-03-09 00:56:31,674 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-03-09 00:56:31,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3149 conditions, 1531 events. 793/1531 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8000 event pairs, 348 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 3064. Up to 734 conditions per place. [2025-03-09 00:56:31,681 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 56 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-09 00:56:31,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 303 flow [2025-03-09 00:56:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-09 00:56:31,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2025-03-09 00:56:31,683 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 153 flow. Second operand 3 states and 102 transitions. [2025-03-09 00:56:31,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 303 flow [2025-03-09 00:56:31,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 301 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:31,685 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 148 flow [2025-03-09 00:56:31,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2025-03-09 00:56:31,686 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2025-03-09 00:56:31,686 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 148 flow [2025-03-09 00:56:31,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:31,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:31,686 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:31,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 00:56:31,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:31,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:31,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1662347340, now seen corresponding path program 1 times [2025-03-09 00:56:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:31,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [699883657] [2025-03-09 00:56:31,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:31,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:31,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:31,891 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:31,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 00:56:31,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:56:32,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:56:32,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:32,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:32,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:56:32,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:32,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:32,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:32,282 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:32,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699883657] [2025-03-09 00:56:32,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699883657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:32,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:32,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:32,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936765714] [2025-03-09 00:56:32,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:32,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:32,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:32,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:32,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:32,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:32,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:32,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:32,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:32,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:32,632 INFO L124 PetriNetUnfolderBase]: 1096/2111 cut-off events. [2025-03-09 00:56:32,633 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-03-09 00:56:32,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 2111 events. 1096/2111 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12217 event pairs, 518 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 1577. Up to 1077 conditions per place. [2025-03-09 00:56:32,645 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 68 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-09 00:56:32,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 89 transitions, 386 flow [2025-03-09 00:56:32,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2025-03-09 00:56:32,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6318181818181818 [2025-03-09 00:56:32,649 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 148 flow. Second operand 4 states and 139 transitions. [2025-03-09 00:56:32,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 89 transitions, 386 flow [2025-03-09 00:56:32,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:32,653 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 175 flow [2025-03-09 00:56:32,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-03-09 00:56:32,654 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-03-09 00:56:32,654 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 175 flow [2025-03-09 00:56:32,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:32,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:32,655 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:32,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:32,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:32,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:32,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:32,857 INFO L85 PathProgramCache]: Analyzing trace with hash 289984105, now seen corresponding path program 1 times [2025-03-09 00:56:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:32,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641101021] [2025-03-09 00:56:32,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:32,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:32,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:32,859 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:32,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 00:56:32,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 00:56:33,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 00:56:33,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:33,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:33,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 00:56:33,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:33,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:33,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:33,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641101021] [2025-03-09 00:56:33,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641101021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:33,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:33,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:56:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015361857] [2025-03-09 00:56:33,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:33,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:33,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:33,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:33,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:33,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:33,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:33,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:33,497 INFO L124 PetriNetUnfolderBase]: 1073/2101 cut-off events. [2025-03-09 00:56:33,497 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2025-03-09 00:56:33,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4668 conditions, 2101 events. 1073/2101 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12297 event pairs, 864 based on Foata normal form. 5/1965 useless extension candidates. Maximal degree in co-relation 1711. Up to 1736 conditions per place. [2025-03-09 00:56:33,508 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 35 selfloop transitions, 1 changer transitions 2/52 dead transitions. [2025-03-09 00:56:33,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 247 flow [2025-03-09 00:56:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:33,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-09 00:56:33,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-03-09 00:56:33,509 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 175 flow. Second operand 3 states and 80 transitions. [2025-03-09 00:56:33,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 247 flow [2025-03-09 00:56:33,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 242 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:33,515 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 165 flow [2025-03-09 00:56:33,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2025-03-09 00:56:33,515 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2025-03-09 00:56:33,515 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 165 flow [2025-03-09 00:56:33,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:33,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:33,516 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:33,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:33,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:33,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:33,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1702265570, now seen corresponding path program 1 times [2025-03-09 00:56:33,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:33,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [243351411] [2025-03-09 00:56:33,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:33,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:33,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:33,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:33,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 00:56:33,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 00:56:34,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 00:56:34,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:34,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:34,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 00:56:34,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:34,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:34,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:34,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243351411] [2025-03-09 00:56:34,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243351411] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:34,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2025-03-09 00:56:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359201631] [2025-03-09 00:56:34,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:34,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:56:34,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:34,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:56:34,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:56:34,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:34,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 165 flow. Second operand has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:34,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:34,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:34,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:38,703 INFO L124 PetriNetUnfolderBase]: 5287/10051 cut-off events. [2025-03-09 00:56:38,703 INFO L125 PetriNetUnfolderBase]: For 2265/2265 co-relation queries the response was YES. [2025-03-09 00:56:38,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22161 conditions, 10051 events. 5287/10051 cut-off events. For 2265/2265 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 69874 event pairs, 756 based on Foata normal form. 264/9718 useless extension candidates. Maximal degree in co-relation 22146. Up to 1753 conditions per place. [2025-03-09 00:56:38,758 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 317 selfloop transitions, 45 changer transitions 0/375 dead transitions. [2025-03-09 00:56:38,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 375 transitions, 1774 flow [2025-03-09 00:56:38,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:56:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 00:56:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 679 transitions. [2025-03-09 00:56:38,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6172727272727273 [2025-03-09 00:56:38,761 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 165 flow. Second operand 20 states and 679 transitions. [2025-03-09 00:56:38,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 375 transitions, 1774 flow [2025-03-09 00:56:38,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 375 transitions, 1773 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:38,772 INFO L231 Difference]: Finished difference. Result has 88 places, 95 transitions, 582 flow [2025-03-09 00:56:38,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=582, PETRI_PLACES=88, PETRI_TRANSITIONS=95} [2025-03-09 00:56:38,772 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-03-09 00:56:38,772 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 95 transitions, 582 flow [2025-03-09 00:56:38,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.0) internal successors, (190), 10 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:38,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:38,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:38,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 00:56:38,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:38,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:38,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1595039957, now seen corresponding path program 1 times [2025-03-09 00:56:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:38,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503107809] [2025-03-09 00:56:38,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:38,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:38,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:38,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:38,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 00:56:39,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:56:39,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:56:39,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:39,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:39,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:56:39,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:39,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:39,422 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:39,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503107809] [2025-03-09 00:56:39,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503107809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:39,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:39,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:39,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439511764] [2025-03-09 00:56:39,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:39,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:39,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:39,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:39,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:39,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:39,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 95 transitions, 582 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:39,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:39,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:39,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:40,028 INFO L124 PetriNetUnfolderBase]: 5035/9503 cut-off events. [2025-03-09 00:56:40,029 INFO L125 PetriNetUnfolderBase]: For 9580/9580 co-relation queries the response was YES. [2025-03-09 00:56:40,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24521 conditions, 9503 events. 5035/9503 cut-off events. For 9580/9580 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 65952 event pairs, 3115 based on Foata normal form. 0/9133 useless extension candidates. Maximal degree in co-relation 24490. Up to 6346 conditions per place. [2025-03-09 00:56:40,096 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 121 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2025-03-09 00:56:40,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 137 transitions, 1146 flow [2025-03-09 00:56:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:40,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-09 00:56:40,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2025-03-09 00:56:40,098 INFO L175 Difference]: Start difference. First operand has 88 places, 95 transitions, 582 flow. Second operand 4 states and 108 transitions. [2025-03-09 00:56:40,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 137 transitions, 1146 flow [2025-03-09 00:56:40,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 137 transitions, 1054 flow, removed 45 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:40,136 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 522 flow [2025-03-09 00:56:40,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=522, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2025-03-09 00:56:40,138 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2025-03-09 00:56:40,138 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 522 flow [2025-03-09 00:56:40,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:40,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:40,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:40,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 00:56:40,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:40,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:40,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1595039958, now seen corresponding path program 1 times [2025-03-09 00:56:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:40,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034202811] [2025-03-09 00:56:40,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:40,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:40,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:40,343 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:40,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 00:56:40,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 00:56:40,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 00:56:40,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:40,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:40,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 00:56:40,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:40,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2025-03-09 00:56:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:40,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:40,734 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:40,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034202811] [2025-03-09 00:56:40,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034202811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:40,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:40,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:56:40,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647200366] [2025-03-09 00:56:40,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:40,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:56:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:40,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:56:40,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:56:40,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:40,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:40,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:40,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:40,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:41,093 INFO L124 PetriNetUnfolderBase]: 2498/5169 cut-off events. [2025-03-09 00:56:41,093 INFO L125 PetriNetUnfolderBase]: For 2568/2568 co-relation queries the response was YES. [2025-03-09 00:56:41,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12238 conditions, 5169 events. 2498/5169 cut-off events. For 2568/2568 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 32005 event pairs, 576 based on Foata normal form. 358/5396 useless extension candidates. Maximal degree in co-relation 12206. Up to 3021 conditions per place. [2025-03-09 00:56:41,125 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 67 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-03-09 00:56:41,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 84 transitions, 555 flow [2025-03-09 00:56:41,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:56:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:56:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-09 00:56:41,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2025-03-09 00:56:41,127 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 522 flow. Second operand 3 states and 93 transitions. [2025-03-09 00:56:41,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 84 transitions, 555 flow [2025-03-09 00:56:41,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 84 transitions, 533 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-03-09 00:56:41,142 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 377 flow [2025-03-09 00:56:41,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=377, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-09 00:56:41,143 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2025-03-09 00:56:41,143 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 377 flow [2025-03-09 00:56:41,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:41,143 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:41,143 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:41,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 00:56:41,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:41,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:41,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash -2058972703, now seen corresponding path program 1 times [2025-03-09 00:56:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:41,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489724782] [2025-03-09 00:56:41,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:41,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:41,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:41,348 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:41,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 00:56:41,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 00:56:41,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 00:56:41,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:41,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:41,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 00:56:41,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:41,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:41,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489724782] [2025-03-09 00:56:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489724782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:41,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:41,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488681022] [2025-03-09 00:56:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:41,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:56:41,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:41,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:56:41,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:56:42,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:42,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 377 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:42,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:42,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:42,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:42,556 INFO L124 PetriNetUnfolderBase]: 2523/5170 cut-off events. [2025-03-09 00:56:42,556 INFO L125 PetriNetUnfolderBase]: For 2027/2027 co-relation queries the response was YES. [2025-03-09 00:56:42,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12423 conditions, 5170 events. 2523/5170 cut-off events. For 2027/2027 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31647 event pairs, 901 based on Foata normal form. 0/5003 useless extension candidates. Maximal degree in co-relation 12397. Up to 3411 conditions per place. [2025-03-09 00:56:42,589 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 99 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2025-03-09 00:56:42,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 719 flow [2025-03-09 00:56:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 00:56:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 00:56:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2025-03-09 00:56:42,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2025-03-09 00:56:42,590 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 377 flow. Second operand 6 states and 182 transitions. [2025-03-09 00:56:42,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 719 flow [2025-03-09 00:56:42,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 120 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:42,601 INFO L231 Difference]: Finished difference. Result has 85 places, 77 transitions, 417 flow [2025-03-09 00:56:42,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=417, PETRI_PLACES=85, PETRI_TRANSITIONS=77} [2025-03-09 00:56:42,602 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2025-03-09 00:56:42,602 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 77 transitions, 417 flow [2025-03-09 00:56:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:42,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:42,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:42,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 00:56:42,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:42,803 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:42,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:42,804 INFO L85 PathProgramCache]: Analyzing trace with hash 479026948, now seen corresponding path program 1 times [2025-03-09 00:56:42,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:42,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553505786] [2025-03-09 00:56:42,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:42,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:42,806 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:42,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 00:56:42,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 00:56:43,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 00:56:43,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:43,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:43,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 00:56:43,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:43,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:43,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553505786] [2025-03-09 00:56:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553505786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:43,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:43,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:43,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857532528] [2025-03-09 00:56:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:43,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:56:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:43,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:56:43,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:56:43,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:43,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 77 transitions, 417 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:43,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:43,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:43,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:43,724 INFO L124 PetriNetUnfolderBase]: 2452/5057 cut-off events. [2025-03-09 00:56:43,724 INFO L125 PetriNetUnfolderBase]: For 2166/2166 co-relation queries the response was YES. [2025-03-09 00:56:43,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12161 conditions, 5057 events. 2452/5057 cut-off events. For 2166/2166 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 31027 event pairs, 872 based on Foata normal form. 7/4932 useless extension candidates. Maximal degree in co-relation 12130. Up to 3351 conditions per place. [2025-03-09 00:56:43,740 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 92 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-03-09 00:56:43,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 709 flow [2025-03-09 00:56:43,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:56:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:56:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2025-03-09 00:56:43,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5890909090909091 [2025-03-09 00:56:43,741 INFO L175 Difference]: Start difference. First operand has 85 places, 77 transitions, 417 flow. Second operand 5 states and 162 transitions. [2025-03-09 00:56:43,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 709 flow [2025-03-09 00:56:43,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 700 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:43,748 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 422 flow [2025-03-09 00:56:43,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-09 00:56:43,749 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 38 predicate places. [2025-03-09 00:56:43,749 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 422 flow [2025-03-09 00:56:43,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:43,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:43,749 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:43,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 00:56:43,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:43,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:43,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:43,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1935320441, now seen corresponding path program 1 times [2025-03-09 00:56:43,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:43,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735437171] [2025-03-09 00:56:43,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:43,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:43,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:43,952 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:43,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 00:56:44,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 00:56:44,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 00:56:44,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:44,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:44,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 00:56:44,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:44,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 00:56:44,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 00:56:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:44,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 00:56:44,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:44,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735437171] [2025-03-09 00:56:44,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735437171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:44,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:44,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 00:56:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496490226] [2025-03-09 00:56:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:56:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:44,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:56:44,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:56:44,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 55 [2025-03-09 00:56:44,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:44,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:44,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 55 [2025-03-09 00:56:44,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:45,719 INFO L124 PetriNetUnfolderBase]: 3822/7715 cut-off events. [2025-03-09 00:56:45,719 INFO L125 PetriNetUnfolderBase]: For 3621/3621 co-relation queries the response was YES. [2025-03-09 00:56:45,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18800 conditions, 7715 events. 3822/7715 cut-off events. For 3621/3621 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 48466 event pairs, 1169 based on Foata normal form. 0/7505 useless extension candidates. Maximal degree in co-relation 18768. Up to 3514 conditions per place. [2025-03-09 00:56:45,778 INFO L140 encePairwiseOnDemand]: 45/55 looper letters, 170 selfloop transitions, 21 changer transitions 0/202 dead transitions. [2025-03-09 00:56:45,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 202 transitions, 1289 flow [2025-03-09 00:56:45,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 00:56:45,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 00:56:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 365 transitions. [2025-03-09 00:56:45,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.474025974025974 [2025-03-09 00:56:45,780 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 422 flow. Second operand 14 states and 365 transitions. [2025-03-09 00:56:45,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 202 transitions, 1289 flow [2025-03-09 00:56:45,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 202 transitions, 1269 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 00:56:45,795 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 530 flow [2025-03-09 00:56:45,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=530, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2025-03-09 00:56:45,796 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 50 predicate places. [2025-03-09 00:56:45,796 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 530 flow [2025-03-09 00:56:45,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:45,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:45,797 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:45,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 00:56:45,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:45,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:45,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:45,998 INFO L85 PathProgramCache]: Analyzing trace with hash -604036277, now seen corresponding path program 1 times [2025-03-09 00:56:45,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:45,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741135562] [2025-03-09 00:56:45,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:45,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:45,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:46,000 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:46,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 00:56:46,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:46,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:46,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:46,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:46,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 00:56:46,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:46,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:46,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:46,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741135562] [2025-03-09 00:56:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741135562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:46,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:46,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-03-09 00:56:46,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870389337] [2025-03-09 00:56:46,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:46,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:56:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:46,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:56:46,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:56:47,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:47,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 530 flow. Second operand has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:47,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:47,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:47,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:51,896 INFO L124 PetriNetUnfolderBase]: 8991/18507 cut-off events. [2025-03-09 00:56:51,896 INFO L125 PetriNetUnfolderBase]: For 10307/10307 co-relation queries the response was YES. [2025-03-09 00:56:51,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45496 conditions, 18507 events. 8991/18507 cut-off events. For 10307/10307 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 139964 event pairs, 2624 based on Foata normal form. 88/18097 useless extension candidates. Maximal degree in co-relation 45461. Up to 2996 conditions per place. [2025-03-09 00:56:51,977 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 308 selfloop transitions, 63 changer transitions 0/383 dead transitions. [2025-03-09 00:56:51,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 383 transitions, 2539 flow [2025-03-09 00:56:51,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 00:56:51,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 00:56:51,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 616 transitions. [2025-03-09 00:56:51,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.56 [2025-03-09 00:56:51,980 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 530 flow. Second operand 20 states and 616 transitions. [2025-03-09 00:56:51,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 383 transitions, 2539 flow [2025-03-09 00:56:52,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 383 transitions, 2477 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-03-09 00:56:52,022 INFO L231 Difference]: Finished difference. Result has 126 places, 130 transitions, 996 flow [2025-03-09 00:56:52,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=996, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2025-03-09 00:56:52,022 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 76 predicate places. [2025-03-09 00:56:52,022 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 996 flow [2025-03-09 00:56:52,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:52,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:52,023 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:52,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 00:56:52,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:52,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:52,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:52,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1316736096, now seen corresponding path program 1 times [2025-03-09 00:56:52,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:52,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [274888337] [2025-03-09 00:56:52,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:52,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:52,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:52,228 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:52,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 00:56:52,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 00:56:52,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 00:56:52,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:52,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:52,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 00:56:52,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:52,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:52,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:53,335 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274888337] [2025-03-09 00:56:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274888337] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:53,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-03-09 00:56:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584446506] [2025-03-09 00:56:53,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:53,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 00:56:53,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:53,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 00:56:53,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 00:56:53,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 55 [2025-03-09 00:56:53,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 996 flow. Second operand has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:53,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:53,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 55 [2025-03-09 00:56:53,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:55,232 INFO L124 PetriNetUnfolderBase]: 8149/16814 cut-off events. [2025-03-09 00:56:55,232 INFO L125 PetriNetUnfolderBase]: For 18671/18671 co-relation queries the response was YES. [2025-03-09 00:56:55,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44176 conditions, 16814 events. 8149/16814 cut-off events. For 18671/18671 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 124569 event pairs, 3233 based on Foata normal form. 7/16419 useless extension candidates. Maximal degree in co-relation 44127. Up to 12397 conditions per place. [2025-03-09 00:56:55,392 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 149 selfloop transitions, 16 changer transitions 0/177 dead transitions. [2025-03-09 00:56:55,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 177 transitions, 1453 flow [2025-03-09 00:56:55,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 00:56:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 00:56:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2025-03-09 00:56:55,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2025-03-09 00:56:55,395 INFO L175 Difference]: Start difference. First operand has 126 places, 130 transitions, 996 flow. Second operand 9 states and 237 transitions. [2025-03-09 00:56:55,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 177 transitions, 1453 flow [2025-03-09 00:56:55,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 177 transitions, 1403 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-03-09 00:56:55,486 INFO L231 Difference]: Finished difference. Result has 135 places, 128 transitions, 998 flow [2025-03-09 00:56:55,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=998, PETRI_PLACES=135, PETRI_TRANSITIONS=128} [2025-03-09 00:56:55,487 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 85 predicate places. [2025-03-09 00:56:55,487 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 128 transitions, 998 flow [2025-03-09 00:56:55,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.5) internal successors, (234), 12 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:55,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:55,487 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:55,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 00:56:55,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:55,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:55,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:55,689 INFO L85 PathProgramCache]: Analyzing trace with hash -340189300, now seen corresponding path program 1 times [2025-03-09 00:56:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:55,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696082531] [2025-03-09 00:56:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:55,693 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:55,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 00:56:55,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:56:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:56:56,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:56,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:56,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 00:56:56,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 00:56:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:56,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 00:56:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:56,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 00:56:56,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696082531] [2025-03-09 00:56:56,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696082531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 00:56:56,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 00:56:56,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-09 00:56:56,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763087788] [2025-03-09 00:56:56,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 00:56:56,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 00:56:56,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 00:56:56,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 00:56:56,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 00:56:56,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2025-03-09 00:56:56,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 128 transitions, 998 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:56,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:56,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2025-03-09 00:56:56,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:58,674 INFO L124 PetriNetUnfolderBase]: 11670/23945 cut-off events. [2025-03-09 00:56:58,675 INFO L125 PetriNetUnfolderBase]: For 33222/33228 co-relation queries the response was YES. [2025-03-09 00:56:58,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64893 conditions, 23945 events. 11670/23945 cut-off events. For 33222/33228 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 186960 event pairs, 2868 based on Foata normal form. 175/23737 useless extension candidates. Maximal degree in co-relation 64841. Up to 5680 conditions per place. [2025-03-09 00:56:58,864 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 274 selfloop transitions, 104 changer transitions 0/391 dead transitions. [2025-03-09 00:56:58,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 391 transitions, 3135 flow [2025-03-09 00:56:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 00:56:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 00:56:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 577 transitions. [2025-03-09 00:56:58,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5828282828282828 [2025-03-09 00:56:58,866 INFO L175 Difference]: Start difference. First operand has 135 places, 128 transitions, 998 flow. Second operand 18 states and 577 transitions. [2025-03-09 00:56:58,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 391 transitions, 3135 flow [2025-03-09 00:56:58,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 391 transitions, 3005 flow, removed 46 selfloop flow, removed 7 redundant places. [2025-03-09 00:56:58,982 INFO L231 Difference]: Finished difference. Result has 155 places, 180 transitions, 1761 flow [2025-03-09 00:56:58,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1761, PETRI_PLACES=155, PETRI_TRANSITIONS=180} [2025-03-09 00:56:58,982 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, 105 predicate places. [2025-03-09 00:56:58,982 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 180 transitions, 1761 flow [2025-03-09 00:56:58,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:58,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:58,983 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:59,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 00:56:59,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:59,183 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-09 00:56:59,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2024010947, now seen corresponding path program 1 times [2025-03-09 00:56:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 00:56:59,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [853341512] [2025-03-09 00:56:59,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:59,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:56:59,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:56:59,186 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 00:56:59,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 00:56:59,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:57:00,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:57:00,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:00,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:00,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:57:00,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 00:57:00,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 00:57:00,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:57:00,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:57:00,741 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-09 00:57:00,741 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:57:00,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:57:00,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 15 remaining) [2025-03-09 00:57:00,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:57:00,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-09 00:57:00,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-09 00:57:00,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2025-03-09 00:57:00,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 15 remaining) [2025-03-09 00:57:00,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 00:57:00,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 00:57:00,945 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:57:00,993 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 00:57:00,994 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 00:57:00,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 12:57:00 BasicIcfg [2025-03-09 00:57:00,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 00:57:01,000 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 00:57:01,000 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 00:57:01,000 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 00:57:01,001 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:56:28" (3/4) ... [2025-03-09 00:57:01,002 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 00:57:01,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 00:57:01,003 INFO L158 Benchmark]: Toolchain (without parser) took 40164.03ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 90.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 727.5MB. Max. memory is 16.1GB. [2025-03-09 00:57:01,003 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 00:57:01,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.59ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 54.9MB in the end (delta: 35.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 00:57:01,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.00ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 49.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:57:01,004 INFO L158 Benchmark]: Boogie Preprocessor took 66.88ms. Allocated memory is still 117.4MB. Free memory was 49.3MB in the beginning and 44.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:57:01,004 INFO L158 Benchmark]: IcfgBuilder took 6817.96ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 44.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 759.1MB. Max. memory is 16.1GB. [2025-03-09 00:57:01,004 INFO L158 Benchmark]: TraceAbstraction took 32638.86ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 22.8MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-03-09 00:57:01,005 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 159.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 00:57:01,006 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 61.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.59ms. Allocated memory is still 117.4MB. Free memory was 90.6MB in the beginning and 54.9MB in the end (delta: 35.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.00ms. Allocated memory is still 117.4MB. Free memory was 54.9MB in the beginning and 49.3MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.88ms. Allocated memory is still 117.4MB. Free memory was 49.3MB in the beginning and 44.3MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 6817.96ms. Allocated memory was 117.4MB in the beginning and 2.7GB in the end (delta: 2.6GB). Free memory was 44.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 759.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32638.86ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 22.8MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 2.7GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 159.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 20. Possible FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; VAL [\old(stack)={3:0}, \old(x)=0, \result=0, arr={3:0}, flag=0, m={4:0}, stack={3:0}, top=1, x=0] [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=0, m={4:0}, top=1] [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); VAL [\old(stack)={3:0}, \result=-2, arr={3:0}, flag=1, m={4:0}, stack={3:0}, top=0] [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] CALL 2 reach_error() [L20] COND FALSE 2 !(0) VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L20] 2 __assert_fail ("0", "stack_longer-1.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1017]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 102 edges, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.5s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1550 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1505 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4434 IncrementalHoareTripleChecker+Invalid, 4497 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 6 mSDtfsCounter, 4434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1761occurred in iteration=14, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 310 NumberOfCodeBlocks, 310 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 4236 SizeOfPredicates, 62 NumberOfNonLiveVariables, 6919 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 2/54 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 00:57:01,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample