./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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/weaver/popl20-more-buffer-mult.wvr.c -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 e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:28:56,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:28:56,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:28:56,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:28:56,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:28:56,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:28:56,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:28:56,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:28:56,368 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:28:56,368 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:28:56,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:28:56,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:28:56,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:28:56,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:28:56,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:28:56,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:28:56,370 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:28:56,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:28:56,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:28:56,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:28:56,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:28:56,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:28:56,372 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 -> e5124dd4a5a155d8a4e322a35428820633f9eccdd993e14120e650d1ba1fbebe [2025-03-17 14:28:56,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:28:56,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:28:56,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:28:56,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:28:56,599 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:28:56,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-03-17 14:28:57,710 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678d59eb2/88c61359af534b3c804f3df99bdf3e77/FLAGb378d12d3 [2025-03-17 14:28:57,963 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:28:57,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-mult.wvr.c [2025-03-17 14:28:57,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678d59eb2/88c61359af534b3c804f3df99bdf3e77/FLAGb378d12d3 [2025-03-17 14:28:58,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/678d59eb2/88c61359af534b3c804f3df99bdf3e77 [2025-03-17 14:28:58,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:28:58,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:28:58,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:28:58,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:28:58,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:28:58,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58, skipping insertion in model container [2025-03-17 14:28:58,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:28:58,457 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:28:58,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:28:58,469 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:28:58,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:28:58,499 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:28:58,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58 WrapperNode [2025-03-17 14:28:58,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:28:58,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:28:58,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:28:58,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:28:58,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,528 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 280 [2025-03-17 14:28:58,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:28:58,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:28:58,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:28:58,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:28:58,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,554 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 14:28:58,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:28:58,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:28:58,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:28:58,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:28:58,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (1/1) ... [2025-03-17 14:28:58,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:28:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:58,596 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-17 14:28:58,601 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-17 14:28:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:28:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:28:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:28:58,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:28:58,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 14:28:58,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 14:28:58,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:28:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:28:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:28:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:28:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:28:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:28:58,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:28:58,618 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:28:58,714 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:28:58,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:28:59,078 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:28:59,078 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:28:59,322 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:28:59,322 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:28:59,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:28:59 BoogieIcfgContainer [2025-03-17 14:28:59,323 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:28:59,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:28:59,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:28:59,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:28:59,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:28:58" (1/3) ... [2025-03-17 14:28:59,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f8d884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:28:59, skipping insertion in model container [2025-03-17 14:28:59,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:28:58" (2/3) ... [2025-03-17 14:28:59,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f8d884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:28:59, skipping insertion in model container [2025-03-17 14:28:59,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:28:59" (3/3) ... [2025-03-17 14:28:59,329 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2025-03-17 14:28:59,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:28:59,342 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 61 locations, 1 initial locations, 6 loop locations, and 14 error locations. [2025-03-17 14:28:59,342 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:28:59,396 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 14:28:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:28:59,451 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2025-03-17 14:28:59,454 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:28:59,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 137 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2025-03-17 14:28:59,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2025-03-17 14:28:59,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2025-03-17 14:28:59,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:28:59,478 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;@5163f65f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:28:59,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-17 14:28:59,482 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:28:59,482 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:28:59,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:28:59,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:59,483 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:28:59,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:28:59,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:59,487 INFO L85 PathProgramCache]: Analyzing trace with hash 767220, now seen corresponding path program 1 times [2025-03-17 14:28:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:28:59,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001806405] [2025-03-17 14:28:59,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:28:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:28:59,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:28:59,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:28:59,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:28:59,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:59,688 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-17 14:28:59,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:28:59,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001806405] [2025-03-17 14:28:59,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001806405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:28:59,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:28:59,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:28:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915276347] [2025-03-17 14:28:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:28:59,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:28:59,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:28:59,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:28:59,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:28:59,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:28:59,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-17 14:28:59,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:59,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:28:59,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:01,121 INFO L124 PetriNetUnfolderBase]: 15159/20183 cut-off events. [2025-03-17 14:29:01,122 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2025-03-17 14:29:01,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40874 conditions, 20183 events. 15159/20183 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 116596 event pairs, 12544 based on Foata normal form. 1/14573 useless extension candidates. Maximal degree in co-relation 38292. Up to 19683 conditions per place. [2025-03-17 14:29:01,240 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 44 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-17 14:29:01,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 230 flow [2025-03-17 14:29:01,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:01,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2025-03-17 14:29:01,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2025-03-17 14:29:01,252 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 97 transitions. [2025-03-17 14:29:01,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 230 flow [2025-03-17 14:29:01,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 214 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-17 14:29:01,366 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2025-03-17 14:29:01,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2025-03-17 14:29:01,370 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2025-03-17 14:29:01,370 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2025-03-17 14:29:01,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-17 14:29:01,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:01,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:29:01,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:29:01,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:01,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 767221, now seen corresponding path program 1 times [2025-03-17 14:29:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:01,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544425820] [2025-03-17 14:29:01,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:01,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:29:01,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:29:01,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:01,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:01,604 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-17 14:29:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544425820] [2025-03-17 14:29:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544425820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:01,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531645100] [2025-03-17 14:29:01,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:01,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:01,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:01,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:29:01,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-17 14:29:01,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:01,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:29:01,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:02,791 INFO L124 PetriNetUnfolderBase]: 15160/20186 cut-off events. [2025-03-17 14:29:02,791 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-17 14:29:02,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40235 conditions, 20186 events. 15160/20186 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 116593 event pairs, 12544 based on Foata normal form. 0/14573 useless extension candidates. Maximal degree in co-relation 40206. Up to 19692 conditions per place. [2025-03-17 14:29:02,965 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 47 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-17 14:29:02,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 234 flow [2025-03-17 14:29:02,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:02,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2025-03-17 14:29:02,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-17 14:29:02,967 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 116 transitions. [2025-03-17 14:29:02,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 234 flow [2025-03-17 14:29:02,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:02,969 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2025-03-17 14:29:02,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2025-03-17 14:29:02,969 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2025-03-17 14:29:02,969 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2025-03-17 14:29:02,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-17 14:29:02,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:02,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:29:02,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:29:02,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash 23785919, now seen corresponding path program 1 times [2025-03-17 14:29:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296520448] [2025-03-17 14:29:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:02,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:29:02,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:29:02,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:02,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:03,132 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-17 14:29:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:03,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296520448] [2025-03-17 14:29:03,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296520448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936198360] [2025-03-17 14:29:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:03,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:03,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:03,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:03,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:29:03,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:29:03,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-17 14:29:03,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:03,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:29:03,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:04,106 INFO L124 PetriNetUnfolderBase]: 15161/20189 cut-off events. [2025-03-17 14:29:04,107 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-17 14:29:04,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40252 conditions, 20189 events. 15161/20189 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 116587 event pairs, 12544 based on Foata normal form. 0/14575 useless extension candidates. Maximal degree in co-relation 40227. Up to 19691 conditions per place. [2025-03-17 14:29:04,198 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 47 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2025-03-17 14:29:04,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 263 flow [2025-03-17 14:29:04,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:04,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-17 14:29:04,200 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:29:04,200 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 135 transitions. [2025-03-17 14:29:04,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 263 flow [2025-03-17 14:29:04,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:04,201 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2025-03-17 14:29:04,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-17 14:29:04,202 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2025-03-17 14:29:04,202 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2025-03-17 14:29:04,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-17 14:29:04,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:04,202 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:29:04,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:29:04,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:04,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:04,203 INFO L85 PathProgramCache]: Analyzing trace with hash 737323749, now seen corresponding path program 1 times [2025-03-17 14:29:04,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:04,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856048551] [2025-03-17 14:29:04,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:04,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:04,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:29:04,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:29:04,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:04,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:04,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856048551] [2025-03-17 14:29:04,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856048551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:04,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830034386] [2025-03-17 14:29:04,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:04,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:04,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:04,439 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-17 14:29:04,440 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-17 14:29:04,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:29:04,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:29:04,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:04,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:04,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:29:04,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:04,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2025-03-17 14:29:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:04,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:04,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830034386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:04,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:04,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:29:04,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940754369] [2025-03-17 14:29:04,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:04,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:29:04,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:04,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:29:04,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:29:04,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:29:04,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 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-17 14:29:04,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:04,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:29:04,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:06,236 INFO L124 PetriNetUnfolderBase]: 15161/20188 cut-off events. [2025-03-17 14:29:06,236 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-17 14:29:06,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40265 conditions, 20188 events. 15161/20188 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 116683 event pairs, 12544 based on Foata normal form. 0/14577 useless extension candidates. Maximal degree in co-relation 40237. Up to 19691 conditions per place. [2025-03-17 14:29:06,316 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 46 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-03-17 14:29:06,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 285 flow [2025-03-17 14:29:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:29:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:29:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2025-03-17 14:29:06,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2025-03-17 14:29:06,318 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 147 transitions. [2025-03-17 14:29:06,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 285 flow [2025-03-17 14:29:06,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:06,319 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2025-03-17 14:29:06,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-17 14:29:06,320 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:29:06,320 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2025-03-17 14:29:06,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 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-17 14:29:06,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:06,321 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:29:06,327 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-17 14:29:06,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:06,521 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:06,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:06,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1383455912, now seen corresponding path program 1 times [2025-03-17 14:29:06,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:06,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-17 14:29:06,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:06,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:06,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:06,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:06,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:06,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:06,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608268098] [2025-03-17 14:29:06,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608268098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:06,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856241624] [2025-03-17 14:29:06,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:06,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:06,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:06,678 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-17 14:29:06,680 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-17 14:29:06,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:29:06,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:29:06,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:06,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:06,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:29:06,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:06,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 9 [2025-03-17 14:29:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:06,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:29:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:07,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856241624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:29:07,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:29:07,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:29:07,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985231917] [2025-03-17 14:29:07,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:29:07,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:29:07,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:07,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:29:07,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:29:07,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:29:07,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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-17 14:29:07,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:07,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:29:07,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:08,148 INFO L124 PetriNetUnfolderBase]: 15163/20193 cut-off events. [2025-03-17 14:29:08,149 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2025-03-17 14:29:08,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40291 conditions, 20193 events. 15163/20193 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 1133. Compared 116587 event pairs, 12544 based on Foata normal form. 0/14582 useless extension candidates. Maximal degree in co-relation 40245. Up to 19684 conditions per place. [2025-03-17 14:29:08,239 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 40 selfloop transitions, 18 changer transitions 0/67 dead transitions. [2025-03-17 14:29:08,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 337 flow [2025-03-17 14:29:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:29:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:29:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 204 transitions. [2025-03-17 14:29:08,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2025-03-17 14:29:08,240 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 9 states and 204 transitions. [2025-03-17 14:29:08,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 67 transitions, 337 flow [2025-03-17 14:29:08,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 290 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:29:08,242 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 210 flow [2025-03-17 14:29:08,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2025-03-17 14:29:08,243 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-17 14:29:08,243 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 210 flow [2025-03-17 14:29:08,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.307692307692307) internal successors, (225), 13 states have internal predecessors, (225), 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-17 14:29:08,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:08,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:08,249 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-17 14:29:08,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:08,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:08,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:08,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1828045126, now seen corresponding path program 1 times [2025-03-17 14:29:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:08,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-03-17 14:29:08,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:08,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:08,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:29:08,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:29:08,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:08,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:08,511 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-17 14:29:08,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:08,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495241362] [2025-03-17 14:29:08,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495241362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:08,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:08,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:08,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713038913] [2025-03-17 14:29:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:08,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:08,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:08,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:08,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:29:08,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 210 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 14:29:08,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:08,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:29:08,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:09,428 INFO L124 PetriNetUnfolderBase]: 18048/24276 cut-off events. [2025-03-17 14:29:09,429 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-17 14:29:09,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48447 conditions, 24276 events. 18048/24276 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 1252. Compared 145342 event pairs, 15126 based on Foata normal form. 633/18658 useless extension candidates. Maximal degree in co-relation 40230. Up to 19698 conditions per place. [2025-03-17 14:29:09,538 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 92 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2025-03-17 14:29:09,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 106 transitions, 528 flow [2025-03-17 14:29:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:09,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2025-03-17 14:29:09,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5484848484848485 [2025-03-17 14:29:09,539 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 210 flow. Second operand 5 states and 181 transitions. [2025-03-17 14:29:09,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 106 transitions, 528 flow [2025-03-17 14:29:09,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 475 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-17 14:29:09,541 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 216 flow [2025-03-17 14:29:09,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2025-03-17 14:29:09,541 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:29:09,541 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 216 flow [2025-03-17 14:29:09,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-17 14:29:09,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:09,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:09,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:29:09,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1816166710, now seen corresponding path program 1 times [2025-03-17 14:29:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99009243] [2025-03-17 14:29:09,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:09,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:09,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:09,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:09,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:09,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99009243] [2025-03-17 14:29:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99009243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:09,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:09,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:09,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944470838] [2025-03-17 14:29:09,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:09,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:09,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:09,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:09,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:29:09,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 14:29:09,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:09,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:29:09,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:10,629 INFO L124 PetriNetUnfolderBase]: 13848/18644 cut-off events. [2025-03-17 14:29:10,630 INFO L125 PetriNetUnfolderBase]: For 1230/1230 co-relation queries the response was YES. [2025-03-17 14:29:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39550 conditions, 18644 events. 13848/18644 cut-off events. For 1230/1230 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 107462 event pairs, 11474 based on Foata normal form. 0/14699 useless extension candidates. Maximal degree in co-relation 31373. Up to 18212 conditions per place. [2025-03-17 14:29:10,739 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 50 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2025-03-17 14:29:10,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 324 flow [2025-03-17 14:29:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:29:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:29:10,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2025-03-17 14:29:10,741 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2025-03-17 14:29:10,741 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 216 flow. Second operand 5 states and 126 transitions. [2025-03-17 14:29:10,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 324 flow [2025-03-17 14:29:10,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:10,744 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 219 flow [2025-03-17 14:29:10,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2025-03-17 14:29:10,745 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:29:10,745 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 219 flow [2025-03-17 14:29:10,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 14:29:10,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:10,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:10,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:29:10,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:10,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:10,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1736747303, now seen corresponding path program 1 times [2025-03-17 14:29:10,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:10,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166649619] [2025-03-17 14:29:10,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:10,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:10,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:10,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:10,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:10,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:10,801 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-17 14:29:10,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:10,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166649619] [2025-03-17 14:29:10,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166649619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:10,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:10,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:10,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221614093] [2025-03-17 14:29:10,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:10,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:10,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:10,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:10,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:10,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:29:10,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 14:29:10,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:10,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:29:10,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:11,618 INFO L124 PetriNetUnfolderBase]: 10167/13757 cut-off events. [2025-03-17 14:29:11,618 INFO L125 PetriNetUnfolderBase]: For 915/915 co-relation queries the response was YES. [2025-03-17 14:29:11,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29202 conditions, 13757 events. 10167/13757 cut-off events. For 915/915 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 76254 event pairs, 8266 based on Foata normal form. 0/11566 useless extension candidates. Maximal degree in co-relation 23092. Up to 13393 conditions per place. [2025-03-17 14:29:11,684 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 51 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2025-03-17 14:29:11,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 327 flow [2025-03-17 14:29:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:11,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2025-03-17 14:29:11,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2025-03-17 14:29:11,685 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 219 flow. Second operand 4 states and 108 transitions. [2025-03-17 14:29:11,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 327 flow [2025-03-17 14:29:11,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:29:11,688 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 213 flow [2025-03-17 14:29:11,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-03-17 14:29:11,689 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2025-03-17 14:29:11,689 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 213 flow [2025-03-17 14:29:11,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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-17 14:29:11,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:11,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:11,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:29:11,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:11,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:11,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1736747302, now seen corresponding path program 1 times [2025-03-17 14:29:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:11,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995553990] [2025-03-17 14:29:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:11,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:11,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:11,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:11,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:11,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:11,744 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-17 14:29:11,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:11,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995553990] [2025-03-17 14:29:11,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995553990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:11,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:11,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:29:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782789114] [2025-03-17 14:29:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:11,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:29:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:11,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:29:11,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:29:11,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:29:11,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 213 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-17 14:29:11,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:11,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:29:11,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:12,652 INFO L124 PetriNetUnfolderBase]: 12936/17848 cut-off events. [2025-03-17 14:29:12,652 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2025-03-17 14:29:12,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37904 conditions, 17848 events. 12936/17848 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 105674 event pairs, 10753 based on Foata normal form. 500/15891 useless extension candidates. Maximal degree in co-relation 23114. Up to 13409 conditions per place. [2025-03-17 14:29:12,711 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 77 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-17 14:29:12,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 93 transitions, 453 flow [2025-03-17 14:29:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 149 transitions. [2025-03-17 14:29:12,712 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5643939393939394 [2025-03-17 14:29:12,712 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 213 flow. Second operand 4 states and 149 transitions. [2025-03-17 14:29:12,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 93 transitions, 453 flow [2025-03-17 14:29:12,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 447 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:12,714 INFO L231 Difference]: Finished difference. Result has 69 places, 65 transitions, 231 flow [2025-03-17 14:29:12,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=69, PETRI_TRANSITIONS=65} [2025-03-17 14:29:12,714 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:29:12,715 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 231 flow [2025-03-17 14:29:12,715 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-17 14:29:12,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:12,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:12,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:29:12,715 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:12,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1816166709, now seen corresponding path program 1 times [2025-03-17 14:29:12,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733808900] [2025-03-17 14:29:12,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:12,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:12,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:12,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:12,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:12,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733808900] [2025-03-17 14:29:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733808900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187183348] [2025-03-17 14:29:12,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:12,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:12,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:12,844 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-17 14:29:12,846 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-17 14:29:12,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:29:12,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:29:12,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:12,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:12,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:29:12,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:12,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-03-17 14:29:12,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:29:12,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:29:12,964 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:29:12,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:29:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:12,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:29:12,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187183348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:12,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:29:12,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-17 14:29:12,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949674791] [2025-03-17 14:29:12,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:12,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:12,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:29:13,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 66 [2025-03-17 14:29:13,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-17 14:29:13,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:13,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 66 [2025-03-17 14:29:13,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:13,508 INFO L124 PetriNetUnfolderBase]: 9642/13381 cut-off events. [2025-03-17 14:29:13,508 INFO L125 PetriNetUnfolderBase]: For 1789/1789 co-relation queries the response was YES. [2025-03-17 14:29:13,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29299 conditions, 13381 events. 9642/13381 cut-off events. For 1789/1789 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 76614 event pairs, 7905 based on Foata normal form. 0/12310 useless extension candidates. Maximal degree in co-relation 16340. Up to 12970 conditions per place. [2025-03-17 14:29:13,562 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 50 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2025-03-17 14:29:13,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 331 flow [2025-03-17 14:29:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-03-17 14:29:13,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2025-03-17 14:29:13,563 INFO L175 Difference]: Start difference. First operand has 69 places, 65 transitions, 231 flow. Second operand 4 states and 106 transitions. [2025-03-17 14:29:13,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 331 flow [2025-03-17 14:29:13,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:13,566 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 226 flow [2025-03-17 14:29:13,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-03-17 14:29:13,567 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:29:13,567 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 226 flow [2025-03-17 14:29:13,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-17 14:29:13,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:13,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:13,573 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-17 14:29:13,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:13,769 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:13,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 297447171, now seen corresponding path program 1 times [2025-03-17 14:29:13,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-03-17 14:29:13,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:13,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:29:13,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:29:13,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:13,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-03-17 14:29:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345542349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851709719] [2025-03-17 14:29:13,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:13,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:13,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:13,902 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-17 14:29:13,904 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-17 14:29:13,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:29:13,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:29:13,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:13,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:13,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 14:29:13,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:29:14,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:29:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851709719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:14,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:29:14,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-17 14:29:14,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119459253] [2025-03-17 14:29:14,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:14,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:14,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:14,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:29:14,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:29:14,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-17 14:29:14,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:14,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:29:14,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:14,420 INFO L124 PetriNetUnfolderBase]: 7325/10281 cut-off events. [2025-03-17 14:29:14,420 INFO L125 PetriNetUnfolderBase]: For 1452/1452 co-relation queries the response was YES. [2025-03-17 14:29:14,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21975 conditions, 10281 events. 7325/10281 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 57496 event pairs, 5929 based on Foata normal form. 0/10047 useless extension candidates. Maximal degree in co-relation 15705. Up to 9905 conditions per place. [2025-03-17 14:29:14,458 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 45 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-03-17 14:29:14,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 61 transitions, 322 flow [2025-03-17 14:29:14,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:29:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:29:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-17 14:29:14,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-17 14:29:14,459 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 226 flow. Second operand 4 states and 112 transitions. [2025-03-17 14:29:14,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 61 transitions, 322 flow [2025-03-17 14:29:14,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:14,461 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 227 flow [2025-03-17 14:29:14,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2025-03-17 14:29:14,461 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 0 predicate places. [2025-03-17 14:29:14,461 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 227 flow [2025-03-17 14:29:14,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-17 14:29:14,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:14,462 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-17 14:29:14,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:29:14,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:14,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:14,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash -933051388, now seen corresponding path program 1 times [2025-03-17 14:29:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:14,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645259712] [2025-03-17 14:29:14,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:14,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:14,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 14:29:14,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:29:14,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:14,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:14,694 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-17 14:29:14,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645259712] [2025-03-17 14:29:14,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645259712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:14,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:14,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278732631] [2025-03-17 14:29:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:14,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:14,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:14,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:14,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:29:14,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-17 14:29:14,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:14,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:29:14,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:15,286 INFO L124 PetriNetUnfolderBase]: 10490/14942 cut-off events. [2025-03-17 14:29:15,286 INFO L125 PetriNetUnfolderBase]: For 2440/2440 co-relation queries the response was YES. [2025-03-17 14:29:15,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31853 conditions, 14942 events. 10490/14942 cut-off events. For 2440/2440 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 88378 event pairs, 4096 based on Foata normal form. 4/14721 useless extension candidates. Maximal degree in co-relation 23679. Up to 7677 conditions per place. [2025-03-17 14:29:15,328 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 70 selfloop transitions, 3 changer transitions 2/84 dead transitions. [2025-03-17 14:29:15,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 436 flow [2025-03-17 14:29:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-17 14:29:15,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-03-17 14:29:15,329 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 227 flow. Second operand 3 states and 116 transitions. [2025-03-17 14:29:15,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 436 flow [2025-03-17 14:29:15,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:15,331 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 226 flow [2025-03-17 14:29:15,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2025-03-17 14:29:15,332 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2025-03-17 14:29:15,332 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 226 flow [2025-03-17 14:29:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-17 14:29:15,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:15,332 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, 1, 1, 1, 1, 1] [2025-03-17 14:29:15,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:29:15,332 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash -199480251, now seen corresponding path program 1 times [2025-03-17 14:29:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401180051] [2025-03-17 14:29:15,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:15,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:15,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:29:15,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:29:15,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:15,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:29:15,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:15,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401180051] [2025-03-17 14:29:15,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401180051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:15,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649975224] [2025-03-17 14:29:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:15,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:15,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:15,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:15,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:15,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:29:15,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 14:29:15,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:15,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:29:15,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:16,040 INFO L124 PetriNetUnfolderBase]: 11405/16293 cut-off events. [2025-03-17 14:29:16,040 INFO L125 PetriNetUnfolderBase]: For 6335/6335 co-relation queries the response was YES. [2025-03-17 14:29:16,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36858 conditions, 16293 events. 11405/16293 cut-off events. For 6335/6335 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 98171 event pairs, 4882 based on Foata normal form. 309/16462 useless extension candidates. Maximal degree in co-relation 30136. Up to 8793 conditions per place. [2025-03-17 14:29:16,113 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 77 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-03-17 14:29:16,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 458 flow [2025-03-17 14:29:16,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:16,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2025-03-17 14:29:16,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-03-17 14:29:16,114 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 226 flow. Second operand 3 states and 118 transitions. [2025-03-17 14:29:16,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 458 flow [2025-03-17 14:29:16,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 88 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:16,117 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 239 flow [2025-03-17 14:29:16,117 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2025-03-17 14:29:16,117 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-03-17 14:29:16,117 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 239 flow [2025-03-17 14:29:16,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 14:29:16,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:16,117 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, 1, 1, 1, 1, 1] [2025-03-17 14:29:16,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:29:16,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:16,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -496762926, now seen corresponding path program 1 times [2025-03-17 14:29:16,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:16,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729458853] [2025-03-17 14:29:16,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:16,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:16,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 14:29:16,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 14:29:16,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:16,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729458853] [2025-03-17 14:29:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729458853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:16,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:16,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:29:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651854500] [2025-03-17 14:29:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:29:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:16,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:29:16,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:29:16,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2025-03-17 14:29:16,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 14:29:16,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:16,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2025-03-17 14:29:16,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:16,912 INFO L124 PetriNetUnfolderBase]: 13025/18785 cut-off events. [2025-03-17 14:29:16,912 INFO L125 PetriNetUnfolderBase]: For 10899/10899 co-relation queries the response was YES. [2025-03-17 14:29:16,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43564 conditions, 18785 events. 13025/18785 cut-off events. For 10899/10899 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 114748 event pairs, 5511 based on Foata normal form. 217/18909 useless extension candidates. Maximal degree in co-relation 36162. Up to 9936 conditions per place. [2025-03-17 14:29:17,002 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 77 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2025-03-17 14:29:17,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 88 transitions, 478 flow [2025-03-17 14:29:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:29:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:29:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-17 14:29:17,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-03-17 14:29:17,003 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 239 flow. Second operand 3 states and 116 transitions. [2025-03-17 14:29:17,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 88 transitions, 478 flow [2025-03-17 14:29:17,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 88 transitions, 463 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:17,008 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 247 flow [2025-03-17 14:29:17,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2025-03-17 14:29:17,008 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-03-17 14:29:17,008 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 247 flow [2025-03-17 14:29:17,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-17 14:29:17,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:17,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:17,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:29:17,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:17,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2105825275, now seen corresponding path program 1 times [2025-03-17 14:29:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989431868] [2025-03-17 14:29:17,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:29:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:17,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 14:29:17,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:29:17,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:17,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:17,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989431868] [2025-03-17 14:29:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989431868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236632937] [2025-03-17 14:29:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:17,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:17,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:17,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:17,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-17 14:29:17,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:17,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:17,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-17 14:29:17,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:18,894 INFO L124 PetriNetUnfolderBase]: 25952/36932 cut-off events. [2025-03-17 14:29:18,894 INFO L125 PetriNetUnfolderBase]: For 16873/16873 co-relation queries the response was YES. [2025-03-17 14:29:19,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85819 conditions, 36932 events. 25952/36932 cut-off events. For 16873/16873 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 244105 event pairs, 2463 based on Foata normal form. 0/35192 useless extension candidates. Maximal degree in co-relation 72184. Up to 20027 conditions per place. [2025-03-17 14:29:19,112 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 177 selfloop transitions, 18 changer transitions 3/206 dead transitions. [2025-03-17 14:29:19,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 206 transitions, 1109 flow [2025-03-17 14:29:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:29:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:29:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 307 transitions. [2025-03-17 14:29:19,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5814393939393939 [2025-03-17 14:29:19,113 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 247 flow. Second operand 8 states and 307 transitions. [2025-03-17 14:29:19,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 206 transitions, 1109 flow [2025-03-17 14:29:19,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 206 transitions, 1076 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:19,122 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 376 flow [2025-03-17 14:29:19,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-03-17 14:29:19,122 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 17 predicate places. [2025-03-17 14:29:19,123 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 376 flow [2025-03-17 14:29:19,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:19,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:19,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:19,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 14:29:19,123 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:19,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1771706171, now seen corresponding path program 2 times [2025-03-17 14:29:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:19,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-03-17 14:29:19,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:29:19,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:19,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:29:19,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 33 of 38 statements. [2025-03-17 14:29:19,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 14:29:19,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:19,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:19,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-03-17 14:29:19,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215612064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:19,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:19,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 14:29:19,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808770548] [2025-03-17 14:29:19,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:19,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:29:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:19,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:29:19,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:29:19,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-17 14:29:19,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 376 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:19,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:19,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-17 14:29:19,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:21,149 INFO L124 PetriNetUnfolderBase]: 26402/37966 cut-off events. [2025-03-17 14:29:21,149 INFO L125 PetriNetUnfolderBase]: For 40148/40164 co-relation queries the response was YES. [2025-03-17 14:29:21,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110232 conditions, 37966 events. 26402/37966 cut-off events. For 40148/40164 co-relation queries the response was YES. Maximal size of possible extension queue 1355. Compared 258463 event pairs, 2545 based on Foata normal form. 138/38077 useless extension candidates. Maximal degree in co-relation 92580. Up to 27000 conditions per place. [2025-03-17 14:29:21,415 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 126 selfloop transitions, 16 changer transitions 29/179 dead transitions. [2025-03-17 14:29:21,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 179 transitions, 1115 flow [2025-03-17 14:29:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:29:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:29:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2025-03-17 14:29:21,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-17 14:29:21,416 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 376 flow. Second operand 6 states and 220 transitions. [2025-03-17 14:29:21,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 179 transitions, 1115 flow [2025-03-17 14:29:21,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 179 transitions, 1115 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 14:29:21,493 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 470 flow [2025-03-17 14:29:21,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=470, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2025-03-17 14:29:21,493 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2025-03-17 14:29:21,494 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 470 flow [2025-03-17 14:29:21,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:21,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:21,494 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:21,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 14:29:21,494 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:21,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:21,494 INFO L85 PathProgramCache]: Analyzing trace with hash 210274553, now seen corresponding path program 3 times [2025-03-17 14:29:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:21,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085312033] [2025-03-17 14:29:21,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:29:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:21,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:29:21,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 33 of 38 statements. [2025-03-17 14:29:21,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 14:29:21,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:21,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:21,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:21,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085312033] [2025-03-17 14:29:21,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085312033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:21,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:21,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243896771] [2025-03-17 14:29:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:21,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:21,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:21,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:21,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:21,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-17 14:29:21,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 470 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:21,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:21,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-17 14:29:21,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:24,556 INFO L124 PetriNetUnfolderBase]: 31671/45675 cut-off events. [2025-03-17 14:29:24,556 INFO L125 PetriNetUnfolderBase]: For 60346/60363 co-relation queries the response was YES. [2025-03-17 14:29:24,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142108 conditions, 45675 events. 31671/45675 cut-off events. For 60346/60363 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 318220 event pairs, 4703 based on Foata normal form. 1085/46737 useless extension candidates. Maximal degree in co-relation 118636. Up to 28370 conditions per place. [2025-03-17 14:29:24,828 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 194 selfloop transitions, 48 changer transitions 8/258 dead transitions. [2025-03-17 14:29:24,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 258 transitions, 1768 flow [2025-03-17 14:29:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:29:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-17 14:29:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 351 transitions. [2025-03-17 14:29:24,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5318181818181819 [2025-03-17 14:29:24,829 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 470 flow. Second operand 10 states and 351 transitions. [2025-03-17 14:29:24,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 258 transitions, 1768 flow [2025-03-17 14:29:24,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 258 transitions, 1717 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:24,958 INFO L231 Difference]: Finished difference. Result has 108 places, 133 transitions, 939 flow [2025-03-17 14:29:24,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=939, PETRI_PLACES=108, PETRI_TRANSITIONS=133} [2025-03-17 14:29:24,958 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 40 predicate places. [2025-03-17 14:29:24,958 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 133 transitions, 939 flow [2025-03-17 14:29:24,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:24,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:24,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:24,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 14:29:24,958 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:24,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:24,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1715201915, now seen corresponding path program 4 times [2025-03-17 14:29:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:24,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646866802] [2025-03-17 14:29:24,959 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:29:24,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:24,965 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:29:24,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:29:24,975 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:29:24,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:25,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:25,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646866802] [2025-03-17 14:29:25,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646866802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:25,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393577147] [2025-03-17 14:29:25,101 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:29:25,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:25,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:25,103 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-17 14:29:25,105 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-17 14:29:25,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:29:25,177 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:29:25,177 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:29:25,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:25,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:29:25,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:25,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:25,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:29:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393577147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:25,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:29:25,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-03-17 14:29:25,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445312971] [2025-03-17 14:29:25,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:25,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:25,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:25,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:25,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:29:25,339 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-17 14:29:25,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 133 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:25,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:25,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-17 14:29:25,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:28,688 INFO L124 PetriNetUnfolderBase]: 33292/47473 cut-off events. [2025-03-17 14:29:28,689 INFO L125 PetriNetUnfolderBase]: For 126008/126011 co-relation queries the response was YES. [2025-03-17 14:29:28,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171975 conditions, 47473 events. 33292/47473 cut-off events. For 126008/126011 co-relation queries the response was YES. Maximal size of possible extension queue 1802. Compared 326149 event pairs, 4637 based on Foata normal form. 452/47896 useless extension candidates. Maximal degree in co-relation 144637. Up to 34897 conditions per place. [2025-03-17 14:29:29,041 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 165 selfloop transitions, 65 changer transitions 5/243 dead transitions. [2025-03-17 14:29:29,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 243 transitions, 2052 flow [2025-03-17 14:29:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:29:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:29:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 252 transitions. [2025-03-17 14:29:29,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-17 14:29:29,042 INFO L175 Difference]: Start difference. First operand has 108 places, 133 transitions, 939 flow. Second operand 7 states and 252 transitions. [2025-03-17 14:29:29,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 243 transitions, 2052 flow [2025-03-17 14:29:29,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 243 transitions, 2024 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-03-17 14:29:29,659 INFO L231 Difference]: Finished difference. Result has 118 places, 155 transitions, 1346 flow [2025-03-17 14:29:29,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1346, PETRI_PLACES=118, PETRI_TRANSITIONS=155} [2025-03-17 14:29:29,659 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2025-03-17 14:29:29,659 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 155 transitions, 1346 flow [2025-03-17 14:29:29,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:29,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:29,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:29,665 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-17 14:29:29,860 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,SelfDestructingSolverStorable17 [2025-03-17 14:29:29,860 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2088432235, now seen corresponding path program 5 times [2025-03-17 14:29:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:29,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266404299] [2025-03-17 14:29:29,861 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:29:29,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:29,868 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:29:29,876 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:29:29,876 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:29,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266404299] [2025-03-17 14:29:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266404299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:29:30,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912312243] [2025-03-17 14:29:30,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:29:30,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:30,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:29:30,011 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-17 14:29:30,012 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-17 14:29:30,062 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:29:30,086 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:29:30,086 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:29:30,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:30,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 14:29:30,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:29:30,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:30,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:29:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912312243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:29:30,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 10 [2025-03-17 14:29:30,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64657785] [2025-03-17 14:29:30,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:30,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:29:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:30,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:29:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:29:30,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-17 14:29:30,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 155 transitions, 1346 flow. Second operand has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:30,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:30,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-17 14:29:30,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:36,527 INFO L124 PetriNetUnfolderBase]: 50018/72378 cut-off events. [2025-03-17 14:29:36,527 INFO L125 PetriNetUnfolderBase]: For 257728/257738 co-relation queries the response was YES. [2025-03-17 14:29:37,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280023 conditions, 72378 events. 50018/72378 cut-off events. For 257728/257738 co-relation queries the response was YES. Maximal size of possible extension queue 2905. Compared 535687 event pairs, 4575 based on Foata normal form. 338/72681 useless extension candidates. Maximal degree in co-relation 244713. Up to 38281 conditions per place. [2025-03-17 14:29:37,399 INFO L140 encePairwiseOnDemand]: 53/66 looper letters, 359 selfloop transitions, 224 changer transitions 11/602 dead transitions. [2025-03-17 14:29:37,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 602 transitions, 6384 flow [2025-03-17 14:29:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:29:37,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:29:37,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 483 transitions. [2025-03-17 14:29:37,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-17 14:29:37,401 INFO L175 Difference]: Start difference. First operand has 118 places, 155 transitions, 1346 flow. Second operand 14 states and 483 transitions. [2025-03-17 14:29:37,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 602 transitions, 6384 flow [2025-03-17 14:29:39,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 602 transitions, 6178 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-17 14:29:39,368 INFO L231 Difference]: Finished difference. Result has 139 places, 332 transitions, 3946 flow [2025-03-17 14:29:39,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3946, PETRI_PLACES=139, PETRI_TRANSITIONS=332} [2025-03-17 14:29:39,368 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 71 predicate places. [2025-03-17 14:29:39,368 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 332 transitions, 3946 flow [2025-03-17 14:29:39,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:29:39,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:39,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:39,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:29:39,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:29:39,571 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:39,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash -665124345, now seen corresponding path program 6 times [2025-03-17 14:29:39,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:39,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737132232] [2025-03-17 14:29:39,572 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:29:39,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:39,580 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 2 equivalence classes. [2025-03-17 14:29:39,587 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 33 of 38 statements. [2025-03-17 14:29:39,587 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-17 14:29:39,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:39,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:29:39,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:39,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737132232] [2025-03-17 14:29:39,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737132232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:39,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:39,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:39,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904379325] [2025-03-17 14:29:39,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:39,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:29:39,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:39,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:29:39,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:29:39,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-17 14:29:39,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 332 transitions, 3946 flow. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:39,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:39,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-17 14:29:39,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:29:48,687 INFO L124 PetriNetUnfolderBase]: 56775/82605 cut-off events. [2025-03-17 14:29:48,687 INFO L125 PetriNetUnfolderBase]: For 417192/417203 co-relation queries the response was YES. [2025-03-17 14:29:49,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375903 conditions, 82605 events. 56775/82605 cut-off events. For 417192/417203 co-relation queries the response was YES. Maximal size of possible extension queue 3338. Compared 625131 event pairs, 9596 based on Foata normal form. 1639/84159 useless extension candidates. Maximal degree in co-relation 348913. Up to 50273 conditions per place. [2025-03-17 14:29:49,616 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 416 selfloop transitions, 142 changer transitions 25/591 dead transitions. [2025-03-17 14:29:49,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 591 transitions, 6728 flow [2025-03-17 14:29:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 14:29:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-17 14:29:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 403 transitions. [2025-03-17 14:29:49,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5550964187327824 [2025-03-17 14:29:49,618 INFO L175 Difference]: Start difference. First operand has 139 places, 332 transitions, 3946 flow. Second operand 11 states and 403 transitions. [2025-03-17 14:29:49,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 591 transitions, 6728 flow [2025-03-17 14:29:55,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 591 transitions, 6713 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-17 14:29:55,619 INFO L231 Difference]: Finished difference. Result has 157 places, 371 transitions, 4857 flow [2025-03-17 14:29:55,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=3740, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4857, PETRI_PLACES=157, PETRI_TRANSITIONS=371} [2025-03-17 14:29:55,619 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 89 predicate places. [2025-03-17 14:29:55,619 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 371 transitions, 4857 flow [2025-03-17 14:29:55,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 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-17 14:29:55,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:29:55,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:29:55,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 14:29:55,620 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2025-03-17 14:29:55,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:29:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1481351973, now seen corresponding path program 7 times [2025-03-17 14:29:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:29:55,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480517993] [2025-03-17 14:29:55,620 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:29:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:29:55,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 14:29:55,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 14:29:55,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:29:55,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:29:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:29:55,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:29:55,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480517993] [2025-03-17 14:29:55,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480517993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:29:55,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:29:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:29:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685106152] [2025-03-17 14:29:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:29:55,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:29:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:29:55,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:29:55,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:29:55,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2025-03-17 14:29:55,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 371 transitions, 4857 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-17 14:29:55,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:29:55,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2025-03-17 14:29:55,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand