./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 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/array-eq-trans.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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:04:54,372 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:04:54,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:04:54,427 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:04:54,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:04:54,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:04:54,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:04:54,455 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:04:54,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:04:54,455 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:04:54,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:04:54,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:04:54,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:04:54,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:04:54,456 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:04:54,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:04:54,457 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:04:54,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:04:54,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:04:54,458 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:04:54,458 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-03-04 10:04:54,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:04:54,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:04:54,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:04:54,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:04:54,681 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:04:54,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-04 10:04:55,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fbb4a96/6cc19aa09062426391df298773e3eb4a/FLAGdcdf66700 [2025-03-04 10:04:56,081 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:04:56,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-04 10:04:56,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fbb4a96/6cc19aa09062426391df298773e3eb4a/FLAGdcdf66700 [2025-03-04 10:04:56,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48fbb4a96/6cc19aa09062426391df298773e3eb4a [2025-03-04 10:04:56,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:04:56,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:04:56,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:04:56,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:04:56,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:04:56,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28aff830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56, skipping insertion in model container [2025-03-04 10:04:56,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,129 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:04:56,260 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-04 10:04:56,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:04:56,274 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:04:56,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:04:56,313 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:04:56,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56 WrapperNode [2025-03-04 10:04:56,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:04:56,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:04:56,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:04:56,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:04:56,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,349 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 187 [2025-03-04 10:04:56,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:04:56,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:04:56,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:04:56,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:04:56,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,386 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:04:56,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:04:56,401 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:04:56,401 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:04:56,401 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:04:56,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (1/1) ... [2025-03-04 10:04:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:04:56,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:04:56,432 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-04 10:04:56,437 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-04 10:04:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:04:56,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:04:56,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:04:56,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:04:56,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:04:56,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:04:56,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:04:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:04:56,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:04:56,457 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:04:56,553 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:04:56,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:04:56,971 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:04:56,971 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:04:57,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:04:57,175 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:04:57,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:04:57 BoogieIcfgContainer [2025-03-04 10:04:57,175 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:04:57,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:04:57,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:04:57,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:04:57,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:04:56" (1/3) ... [2025-03-04 10:04:57,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27609794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:04:57, skipping insertion in model container [2025-03-04 10:04:57,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:04:56" (2/3) ... [2025-03-04 10:04:57,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27609794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:04:57, skipping insertion in model container [2025-03-04 10:04:57,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:04:57" (3/3) ... [2025-03-04 10:04:57,183 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-03-04 10:04:57,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:04:57,196 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 91 locations, 1 initial locations, 6 loop locations, and 32 error locations. [2025-03-04 10:04:57,197 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:04:57,270 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:04:57,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 105 transitions, 231 flow [2025-03-04 10:04:57,333 INFO L124 PetriNetUnfolderBase]: 15/102 cut-off events. [2025-03-04 10:04:57,335 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:04:57,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 15/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 273 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2025-03-04 10:04:57,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 105 transitions, 231 flow [2025-03-04 10:04:57,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 101 transitions, 220 flow [2025-03-04 10:04:57,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:04:57,357 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;@1dd93997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:04:57,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-03-04 10:04:57,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:04:57,362 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:04:57,362 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:04:57,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:57,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:04:57,363 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:04:57,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash 672057, now seen corresponding path program 1 times [2025-03-04 10:04:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:57,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917565798] [2025-03-04 10:04:57,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:57,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:04:57,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:04:57,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:57,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:57,554 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-04 10:04:57,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:57,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917565798] [2025-03-04 10:04:57,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917565798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:57,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:57,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:04:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251223546] [2025-03-04 10:04:57,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:57,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:04:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:57,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:04:57,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:04:57,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:04:57,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-04 10:04:57,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:57,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:04:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:57,840 INFO L124 PetriNetUnfolderBase]: 534/1059 cut-off events. [2025-03-04 10:04:57,841 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 10:04:57,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1797 conditions, 1059 events. 534/1059 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6200 event pairs, 210 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 1547. Up to 662 conditions per place. [2025-03-04 10:04:57,854 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 35 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-03-04 10:04:57,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 96 transitions, 284 flow [2025-03-04 10:04:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:04:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:04:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2025-03-04 10:04:57,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7301587301587301 [2025-03-04 10:04:57,869 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 220 flow. Second operand 3 states and 230 transitions. [2025-03-04 10:04:57,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 96 transitions, 284 flow [2025-03-04 10:04:57,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 96 transitions, 272 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:04:57,876 INFO L231 Difference]: Finished difference. Result has 87 places, 96 transitions, 202 flow [2025-03-04 10:04:57,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=87, PETRI_TRANSITIONS=96} [2025-03-04 10:04:57,881 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -9 predicate places. [2025-03-04 10:04:57,882 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 202 flow [2025-03-04 10:04:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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-04 10:04:57,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:57,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:04:57,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:04:57,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:04:57,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash 672058, now seen corresponding path program 1 times [2025-03-04 10:04:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:57,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887644969] [2025-03-04 10:04:57,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:57,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:04:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:04:57,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:57,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:58,185 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-04 10:04:58,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887644969] [2025-03-04 10:04:58,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887644969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:58,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:58,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:04:58,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238095662] [2025-03-04 10:04:58,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:58,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:04:58,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:58,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:04:58,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:04:58,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:04:58,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-04 10:04:58,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:58,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:04:58,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:58,444 INFO L124 PetriNetUnfolderBase]: 535/1062 cut-off events. [2025-03-04 10:04:58,444 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:04:58,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 1062 events. 535/1062 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6219 event pairs, 210 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 1727. Up to 675 conditions per place. [2025-03-04 10:04:58,453 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 39 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2025-03-04 10:04:58,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 99 transitions, 294 flow [2025-03-04 10:04:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:04:58,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:04:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 296 transitions. [2025-03-04 10:04:58,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7047619047619048 [2025-03-04 10:04:58,458 INFO L175 Difference]: Start difference. First operand has 87 places, 96 transitions, 202 flow. Second operand 4 states and 296 transitions. [2025-03-04 10:04:58,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 99 transitions, 294 flow [2025-03-04 10:04:58,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 99 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:04:58,461 INFO L231 Difference]: Finished difference. Result has 90 places, 99 transitions, 225 flow [2025-03-04 10:04:58,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=90, PETRI_TRANSITIONS=99} [2025-03-04 10:04:58,461 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -6 predicate places. [2025-03-04 10:04:58,461 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 225 flow [2025-03-04 10:04:58,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 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-04 10:04:58,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:58,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:04:58,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:04:58,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:04:58,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash 20833324, now seen corresponding path program 1 times [2025-03-04 10:04:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161362513] [2025-03-04 10:04:58,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:58,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:04:58,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:04:58,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:58,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:58,660 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-04 10:04:58,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:58,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161362513] [2025-03-04 10:04:58,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161362513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:04:58,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:04:58,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:04:58,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830450790] [2025-03-04 10:04:58,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:04:58,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:04:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:58,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:04:58,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:04:58,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:04:58,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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-04 10:04:58,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:58,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:04:58,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:04:58,942 INFO L124 PetriNetUnfolderBase]: 536/1065 cut-off events. [2025-03-04 10:04:58,942 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 10:04:58,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1065 events. 536/1065 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6230 event pairs, 210 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 1756. Up to 674 conditions per place. [2025-03-04 10:04:58,950 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 39 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2025-03-04 10:04:58,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 323 flow [2025-03-04 10:04:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:04:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:04:58,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 362 transitions. [2025-03-04 10:04:58,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6895238095238095 [2025-03-04 10:04:58,953 INFO L175 Difference]: Start difference. First operand has 90 places, 99 transitions, 225 flow. Second operand 5 states and 362 transitions. [2025-03-04 10:04:58,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 323 flow [2025-03-04 10:04:58,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:04:58,957 INFO L231 Difference]: Finished difference. Result has 95 places, 102 transitions, 259 flow [2025-03-04 10:04:58,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=95, PETRI_TRANSITIONS=102} [2025-03-04 10:04:58,958 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, -1 predicate places. [2025-03-04 10:04:58,959 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 259 flow [2025-03-04 10:04:58,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.8) internal successors, (319), 5 states have internal predecessors, (319), 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-04 10:04:58,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:04:58,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:04:58,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:04:58,960 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:04:58,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:04:58,960 INFO L85 PathProgramCache]: Analyzing trace with hash 645867277, now seen corresponding path program 1 times [2025-03-04 10:04:58,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:04:58,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397570426] [2025-03-04 10:04:58,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:58,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:04:58,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:04:58,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:04:58,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:58,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:59,166 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-04 10:04:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:04:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397570426] [2025-03-04 10:04:59,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397570426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:04:59,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067401481] [2025-03-04 10:04:59,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:04:59,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:04:59,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:04:59,169 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-04 10:04:59,171 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-04 10:04:59,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:04:59,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:04:59,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:04:59,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:04:59,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:04:59,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:04:59,275 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 8 treesize of output 1 [2025-03-04 10:04:59,387 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-04 10:04:59,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:04:59,475 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-04 10:04:59,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067401481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:04:59,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:04:59,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:04:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654290303] [2025-03-04 10:04:59,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:04:59,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:04:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:04:59,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:04:59,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:04:59,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:04:59,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 102 transitions, 259 flow. Second operand has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 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-04 10:04:59,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:04:59,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:04:59,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:00,146 INFO L124 PetriNetUnfolderBase]: 536/1064 cut-off events. [2025-03-04 10:05:00,148 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:05:00,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 1064 events. 536/1064 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6252 event pairs, 210 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 1766. Up to 674 conditions per place. [2025-03-04 10:05:00,161 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 38 selfloop transitions, 7 changer transitions 0/101 dead transitions. [2025-03-04 10:05:00,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 101 transitions, 345 flow [2025-03-04 10:05:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:05:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:05:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 421 transitions. [2025-03-04 10:05:00,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6682539682539682 [2025-03-04 10:05:00,164 INFO L175 Difference]: Start difference. First operand has 95 places, 102 transitions, 259 flow. Second operand 6 states and 421 transitions. [2025-03-04 10:05:00,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 101 transitions, 345 flow [2025-03-04 10:05:00,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 101 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:05:00,168 INFO L231 Difference]: Finished difference. Result has 98 places, 101 transitions, 268 flow [2025-03-04 10:05:00,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=268, PETRI_PLACES=98, PETRI_TRANSITIONS=101} [2025-03-04 10:05:00,170 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 2 predicate places. [2025-03-04 10:05:00,170 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 101 transitions, 268 flow [2025-03-04 10:05:00,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.36363636363636) internal successors, (708), 11 states have internal predecessors, (708), 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-04 10:05:00,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:00,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 10:05:00,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:05:00,371 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-04 10:05:00,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:00,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:00,373 INFO L85 PathProgramCache]: Analyzing trace with hash 645835800, now seen corresponding path program 1 times [2025-03-04 10:05:00,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:00,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87166878] [2025-03-04 10:05:00,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:00,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:00,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:05:00,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:05:00,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:00,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:00,504 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-04 10:05:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87166878] [2025-03-04 10:05:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87166878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:00,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:00,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370329907] [2025-03-04 10:05:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:00,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:00,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:00,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:00,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:00,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:05:00,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 101 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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-04 10:05:00,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:00,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:05:00,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:00,772 INFO L124 PetriNetUnfolderBase]: 537/1067 cut-off events. [2025-03-04 10:05:00,772 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:05:00,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1807 conditions, 1067 events. 537/1067 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6266 event pairs, 210 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1774. Up to 676 conditions per place. [2025-03-04 10:05:00,778 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 39 selfloop transitions, 9 changer transitions 0/104 dead transitions. [2025-03-04 10:05:00,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 104 transitions, 370 flow [2025-03-04 10:05:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:00,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 361 transitions. [2025-03-04 10:05:00,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6876190476190476 [2025-03-04 10:05:00,780 INFO L175 Difference]: Start difference. First operand has 98 places, 101 transitions, 268 flow. Second operand 5 states and 361 transitions. [2025-03-04 10:05:00,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 104 transitions, 370 flow [2025-03-04 10:05:00,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 104 transitions, 336 flow, removed 3 selfloop flow, removed 8 redundant places. [2025-03-04 10:05:00,782 INFO L231 Difference]: Finished difference. Result has 96 places, 104 transitions, 277 flow [2025-03-04 10:05:00,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=96, PETRI_TRANSITIONS=104} [2025-03-04 10:05:00,783 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 0 predicate places. [2025-03-04 10:05:00,783 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 277 flow [2025-03-04 10:05:00,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 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-04 10:05:00,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:00,783 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:05:00,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:05:00,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:00,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1453992130, now seen corresponding path program 1 times [2025-03-04 10:05:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877299896] [2025-03-04 10:05:00,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:00,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:05:00,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:05:00,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:00,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:00,940 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-04 10:05:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877299896] [2025-03-04 10:05:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877299896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770624079] [2025-03-04 10:05:00,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:00,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:00,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:00,943 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-04 10:05:00,944 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-04 10:05:00,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:05:00,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:05:00,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:00,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:00,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:05:00,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:01,011 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-04 10:05:01,160 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-04 10:05:01,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:01,304 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-04 10:05:01,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770624079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:01,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:01,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:05:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159436258] [2025-03-04 10:05:01,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:01,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:05:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:01,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:05:01,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:05:01,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:05:01,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 277 flow. Second operand has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 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-04 10:05:01,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:01,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:05:01,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:02,172 INFO L124 PetriNetUnfolderBase]: 537/1066 cut-off events. [2025-03-04 10:05:02,172 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 10:05:02,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1805 conditions, 1066 events. 537/1066 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6205 event pairs, 210 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 1763. Up to 669 conditions per place. [2025-03-04 10:05:02,177 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 35 selfloop transitions, 12 changer transitions 0/103 dead transitions. [2025-03-04 10:05:02,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 103 transitions, 367 flow [2025-03-04 10:05:02,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:05:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:05:02,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 486 transitions. [2025-03-04 10:05:02,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612244897959184 [2025-03-04 10:05:02,181 INFO L175 Difference]: Start difference. First operand has 96 places, 104 transitions, 277 flow. Second operand 7 states and 486 transitions. [2025-03-04 10:05:02,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 103 transitions, 367 flow [2025-03-04 10:05:02,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 103 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:02,184 INFO L231 Difference]: Finished difference. Result has 99 places, 103 transitions, 290 flow [2025-03-04 10:05:02,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=290, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2025-03-04 10:05:02,184 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2025-03-04 10:05:02,184 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 103 transitions, 290 flow [2025-03-04 10:05:02,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.3076923076923) internal successors, (836), 13 states have internal predecessors, (836), 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-04 10:05:02,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:02,185 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 10:05:02,192 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-04 10:05:02,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:05:02,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:02,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:02,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2122032423, now seen corresponding path program 1 times [2025-03-04 10:05:02,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:02,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692927834] [2025-03-04 10:05:02,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:02,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:02,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:05:02,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:05:02,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:02,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:02,564 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-04 10:05:02,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692927834] [2025-03-04 10:05:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692927834] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455708124] [2025-03-04 10:05:02,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:02,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:02,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:02,567 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-04 10:05:02,568 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-04 10:05:02,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:05:02,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:05:02,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:02,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:02,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:05:02,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:02,642 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 8 treesize of output 1 [2025-03-04 10:05:02,736 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-04 10:05:02,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:02,837 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-04 10:05:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455708124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:02,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:02,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:05:02,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295313879] [2025-03-04 10:05:02,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:02,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:05:02,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:02,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:05:02,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:05:03,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:05:03,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 103 transitions, 290 flow. Second operand has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 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-04 10:05:03,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:03,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:05:03,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:03,795 INFO L124 PetriNetUnfolderBase]: 539/1071 cut-off events. [2025-03-04 10:05:03,795 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 10:05:03,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 1071 events. 539/1071 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6274 event pairs, 210 based on Foata normal form. 0/576 useless extension candidates. Maximal degree in co-relation 1768. Up to 670 conditions per place. [2025-03-04 10:05:03,800 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 31 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2025-03-04 10:05:03,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 416 flow [2025-03-04 10:05:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:05:03,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:05:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 618 transitions. [2025-03-04 10:05:03,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.653968253968254 [2025-03-04 10:05:03,803 INFO L175 Difference]: Start difference. First operand has 99 places, 103 transitions, 290 flow. Second operand 9 states and 618 transitions. [2025-03-04 10:05:03,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 416 flow [2025-03-04 10:05:03,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 108 transitions, 389 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 10:05:03,805 INFO L231 Difference]: Finished difference. Result has 101 places, 108 transitions, 327 flow [2025-03-04 10:05:03,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=101, PETRI_TRANSITIONS=108} [2025-03-04 10:05:03,805 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-03-04 10:05:03,805 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 108 transitions, 327 flow [2025-03-04 10:05:03,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 64.46153846153847) internal successors, (838), 13 states have internal predecessors, (838), 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-04 10:05:03,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:03,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:03,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:05:04,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:04,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:04,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1354099825, now seen corresponding path program 1 times [2025-03-04 10:05:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:04,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065781916] [2025-03-04 10:05:04,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:04,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:05:04,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:05:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:04,071 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-04 10:05:04,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:04,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065781916] [2025-03-04 10:05:04,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065781916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:04,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:04,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:04,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070490269] [2025-03-04 10:05:04,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:05:04,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:04,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:05:04,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:05:04,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-04 10:05:04,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 108 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-04 10:05:04,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:04,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-04 10:05:04,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:04,272 INFO L124 PetriNetUnfolderBase]: 847/1773 cut-off events. [2025-03-04 10:05:04,272 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 10:05:04,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3006 conditions, 1773 events. 847/1773 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11872 event pairs, 368 based on Foata normal form. 32/1034 useless extension candidates. Maximal degree in co-relation 2055. Up to 781 conditions per place. [2025-03-04 10:05:04,282 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 86 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2025-03-04 10:05:04,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 148 transitions, 657 flow [2025-03-04 10:05:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 404 transitions. [2025-03-04 10:05:04,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7695238095238095 [2025-03-04 10:05:04,284 INFO L175 Difference]: Start difference. First operand has 101 places, 108 transitions, 327 flow. Second operand 5 states and 404 transitions. [2025-03-04 10:05:04,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 148 transitions, 657 flow [2025-03-04 10:05:04,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 148 transitions, 585 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 10:05:04,286 INFO L231 Difference]: Finished difference. Result has 101 places, 112 transitions, 333 flow [2025-03-04 10:05:04,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=101, PETRI_TRANSITIONS=112} [2025-03-04 10:05:04,287 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 5 predicate places. [2025-03-04 10:05:04,287 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 112 transitions, 333 flow [2025-03-04 10:05:04,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 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-04 10:05:04,287 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:04,287 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:05:04,288 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:04,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:04,288 INFO L85 PathProgramCache]: Analyzing trace with hash 43778728, now seen corresponding path program 1 times [2025-03-04 10:05:04,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:04,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771674377] [2025-03-04 10:05:04,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:04,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:05:04,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:05:04,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:04,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:04,336 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-04 10:05:04,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771674377] [2025-03-04 10:05:04,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771674377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:04,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:04,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:05:04,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179295078] [2025-03-04 10:05:04,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:04,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:04,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:04,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:04,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:04,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-04 10:05:04,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 112 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-04 10:05:04,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:04,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-04 10:05:04,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:04,568 INFO L124 PetriNetUnfolderBase]: 1192/2550 cut-off events. [2025-03-04 10:05:04,568 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 10:05:04,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4310 conditions, 2550 events. 1192/2550 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18731 event pairs, 554 based on Foata normal form. 50/1577 useless extension candidates. Maximal degree in co-relation 2882. Up to 1164 conditions per place. [2025-03-04 10:05:04,580 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 86 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2025-03-04 10:05:04,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 148 transitions, 627 flow [2025-03-04 10:05:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:04,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 395 transitions. [2025-03-04 10:05:04,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2025-03-04 10:05:04,582 INFO L175 Difference]: Start difference. First operand has 101 places, 112 transitions, 333 flow. Second operand 5 states and 395 transitions. [2025-03-04 10:05:04,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 148 transitions, 627 flow [2025-03-04 10:05:04,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:04,584 INFO L231 Difference]: Finished difference. Result has 104 places, 112 transitions, 345 flow [2025-03-04 10:05:04,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=104, PETRI_TRANSITIONS=112} [2025-03-04 10:05:04,585 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2025-03-04 10:05:04,585 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 112 transitions, 345 flow [2025-03-04 10:05:04,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-04 10:05:04,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:04,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:04,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:05:04,586 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:04,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1624581731, now seen corresponding path program 1 times [2025-03-04 10:05:04,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:04,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875221094] [2025-03-04 10:05:04,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:04,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:04,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:05:04,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:05:04,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:04,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:04,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:04,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875221094] [2025-03-04 10:05:04,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875221094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:05:04,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964348660] [2025-03-04 10:05:04,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:04,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:04,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:04,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:04,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:04,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-04 10:05:04,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 112 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-04 10:05:04,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:04,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-04 10:05:04,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:04,912 INFO L124 PetriNetUnfolderBase]: 1469/3108 cut-off events. [2025-03-04 10:05:04,913 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-04 10:05:04,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5316 conditions, 3108 events. 1469/3108 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23209 event pairs, 431 based on Foata normal form. 18/1891 useless extension candidates. Maximal degree in co-relation 3550. Up to 943 conditions per place. [2025-03-04 10:05:04,928 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 110 selfloop transitions, 8 changer transitions 0/173 dead transitions. [2025-03-04 10:05:04,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 173 transitions, 746 flow [2025-03-04 10:05:04,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:04,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 420 transitions. [2025-03-04 10:05:04,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8 [2025-03-04 10:05:04,930 INFO L175 Difference]: Start difference. First operand has 104 places, 112 transitions, 345 flow. Second operand 5 states and 420 transitions. [2025-03-04 10:05:04,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 173 transitions, 746 flow [2025-03-04 10:05:04,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 173 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:04,933 INFO L231 Difference]: Finished difference. Result has 108 places, 113 transitions, 368 flow [2025-03-04 10:05:04,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=368, PETRI_PLACES=108, PETRI_TRANSITIONS=113} [2025-03-04 10:05:04,933 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2025-03-04 10:05:04,933 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 113 transitions, 368 flow [2025-03-04 10:05:04,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.6) internal successors, (333), 5 states have internal predecessors, (333), 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-04 10:05:04,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:04,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:04,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:05:04,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:04,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:04,934 INFO L85 PathProgramCache]: Analyzing trace with hash -913468783, now seen corresponding path program 1 times [2025-03-04 10:05:04,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:04,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153007650] [2025-03-04 10:05:04,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:04,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:05:04,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:05:04,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:04,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:05,002 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-04 10:05:05,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:05,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153007650] [2025-03-04 10:05:05,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153007650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:05,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:05,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830952060] [2025-03-04 10:05:05,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:05,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:05:05,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:05,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:05:05,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:05:05,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-04 10:05:05,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 113 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-04 10:05:05,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:05,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-04 10:05:05,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:05,208 INFO L124 PetriNetUnfolderBase]: 1209/2262 cut-off events. [2025-03-04 10:05:05,209 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-03-04 10:05:05,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4231 conditions, 2262 events. 1209/2262 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 14761 event pairs, 625 based on Foata normal form. 20/1637 useless extension candidates. Maximal degree in co-relation 3004. Up to 1396 conditions per place. [2025-03-04 10:05:05,219 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 85 selfloop transitions, 7 changer transitions 0/147 dead transitions. [2025-03-04 10:05:05,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 653 flow [2025-03-04 10:05:05,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2025-03-04 10:05:05,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2025-03-04 10:05:05,221 INFO L175 Difference]: Start difference. First operand has 108 places, 113 transitions, 368 flow. Second operand 5 states and 402 transitions. [2025-03-04 10:05:05,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 653 flow [2025-03-04 10:05:05,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:05,223 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 380 flow [2025-03-04 10:05:05,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-03-04 10:05:05,224 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 15 predicate places. [2025-03-04 10:05:05,224 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 380 flow [2025-03-04 10:05:05,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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-04 10:05:05,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:05,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:05,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:05:05,224 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:05,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:05,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1071767610, now seen corresponding path program 1 times [2025-03-04 10:05:05,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467776961] [2025-03-04 10:05:05,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:05,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:05:05,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:05:05,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:05,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467776961] [2025-03-04 10:05:05,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467776961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:05,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:05,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:05:05,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087746108] [2025-03-04 10:05:05,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:05,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:05,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:05,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:05,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:05,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-04 10:05:05,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-04 10:05:05,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:05,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-04 10:05:05,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:05,621 INFO L124 PetriNetUnfolderBase]: 1657/3705 cut-off events. [2025-03-04 10:05:05,621 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-03-04 10:05:05,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 3705 events. 1657/3705 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 29723 event pairs, 891 based on Foata normal form. 62/2658 useless extension candidates. Maximal degree in co-relation 5411. Up to 1627 conditions per place. [2025-03-04 10:05:05,640 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 76 selfloop transitions, 8 changer transitions 0/139 dead transitions. [2025-03-04 10:05:05,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 139 transitions, 610 flow [2025-03-04 10:05:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 392 transitions. [2025-03-04 10:05:05,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7466666666666667 [2025-03-04 10:05:05,642 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 380 flow. Second operand 5 states and 392 transitions. [2025-03-04 10:05:05,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 139 transitions, 610 flow [2025-03-04 10:05:05,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 139 transitions, 596 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:05:05,644 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 386 flow [2025-03-04 10:05:05,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-04 10:05:05,645 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 16 predicate places. [2025-03-04 10:05:05,645 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 386 flow [2025-03-04 10:05:05,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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-04 10:05:05,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:05,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:05,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:05:05,646 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:05,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1341498479, now seen corresponding path program 1 times [2025-03-04 10:05:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327463514] [2025-03-04 10:05:05,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:05,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:05:05,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:05:05,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:05,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:05,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327463514] [2025-03-04 10:05:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327463514] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823990104] [2025-03-04 10:05:05,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:05,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:05,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:05,866 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-04 10:05:05,868 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-04 10:05:05,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:05:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:05:05,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:05,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:05,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:05:05,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:05,927 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-04 10:05:05,980 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 10:05:05,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-04 10:05:05,984 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 16 treesize of output 11 [2025-03-04 10:05:06,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:05:06,019 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 16 treesize of output 11 [2025-03-04 10:05:06,026 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:05:06,027 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-04 10:05:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:06,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:06,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 183 [2025-03-04 10:05:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:05:06,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823990104] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:06,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:06,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-04 10:05:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774123486] [2025-03-04 10:05:06,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:06,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:05:06,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:06,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:05:06,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:05:08,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 105 [2025-03-04 10:05:08,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 386 flow. Second operand has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 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-04 10:05:08,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:08,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 105 [2025-03-04 10:05:08,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:09,509 INFO L124 PetriNetUnfolderBase]: 3143/5923 cut-off events. [2025-03-04 10:05:09,509 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2025-03-04 10:05:09,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10947 conditions, 5923 events. 3143/5923 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45852 event pairs, 1276 based on Foata normal form. 0/4310 useless extension candidates. Maximal degree in co-relation 8711. Up to 1763 conditions per place. [2025-03-04 10:05:09,537 INFO L140 encePairwiseOnDemand]: 89/105 looper letters, 117 selfloop transitions, 20 changer transitions 0/183 dead transitions. [2025-03-04 10:05:09,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 183 transitions, 839 flow [2025-03-04 10:05:09,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:05:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:05:09,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 559 transitions. [2025-03-04 10:05:09,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6654761904761904 [2025-03-04 10:05:09,539 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 386 flow. Second operand 8 states and 559 transitions. [2025-03-04 10:05:09,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 183 transitions, 839 flow [2025-03-04 10:05:09,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:09,542 INFO L231 Difference]: Finished difference. Result has 120 places, 117 transitions, 462 flow [2025-03-04 10:05:09,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=462, PETRI_PLACES=120, PETRI_TRANSITIONS=117} [2025-03-04 10:05:09,543 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 24 predicate places. [2025-03-04 10:05:09,543 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 117 transitions, 462 flow [2025-03-04 10:05:09,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.142857142857146) internal successors, (772), 14 states have internal predecessors, (772), 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-04 10:05:09,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:09,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:09,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:05:09,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:09,744 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:09,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:09,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1363219500, now seen corresponding path program 1 times [2025-03-04 10:05:09,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:09,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801972881] [2025-03-04 10:05:09,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:09,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:09,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:05:09,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:05:09,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:09,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:09,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801972881] [2025-03-04 10:05:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801972881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244282809] [2025-03-04 10:05:09,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:09,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:09,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:09,928 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-04 10:05:09,929 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-04 10:05:09,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:05:09,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:05:09,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:09,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:09,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:05:09,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:09,996 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-04 10:05:10,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:05:10,044 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 16 treesize of output 11 [2025-03-04 10:05:10,049 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:05:10,050 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-04 10:05:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:10,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:10,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-03-04 10:05:10,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:05:10,208 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 34 treesize of output 39 [2025-03-04 10:05:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:10,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244282809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:10,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:05:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179813938] [2025-03-04 10:05:10,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:10,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:05:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:10,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:05:10,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:05:14,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:18,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:22,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:26,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:30,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:34,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:38,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:42,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:46,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:50,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:05:50,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 105 [2025-03-04 10:05:50,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 117 transitions, 462 flow. Second operand has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 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-04 10:05:50,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:50,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 105 [2025-03-04 10:05:50,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:51,345 INFO L124 PetriNetUnfolderBase]: 4406/7448 cut-off events. [2025-03-04 10:05:51,345 INFO L125 PetriNetUnfolderBase]: For 1269/1293 co-relation queries the response was YES. [2025-03-04 10:05:51,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15225 conditions, 7448 events. 4406/7448 cut-off events. For 1269/1293 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 53071 event pairs, 914 based on Foata normal form. 8/5702 useless extension candidates. Maximal degree in co-relation 12722. Up to 2382 conditions per place. [2025-03-04 10:05:51,380 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 160 selfloop transitions, 29 changer transitions 0/234 dead transitions. [2025-03-04 10:05:51,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 234 transitions, 1162 flow [2025-03-04 10:05:51,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:05:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:05:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 673 transitions. [2025-03-04 10:05:51,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6409523809523809 [2025-03-04 10:05:51,382 INFO L175 Difference]: Start difference. First operand has 120 places, 117 transitions, 462 flow. Second operand 10 states and 673 transitions. [2025-03-04 10:05:51,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 234 transitions, 1162 flow [2025-03-04 10:05:51,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 234 transitions, 1135 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:51,388 INFO L231 Difference]: Finished difference. Result has 131 places, 128 transitions, 603 flow [2025-03-04 10:05:51,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=131, PETRI_TRANSITIONS=128} [2025-03-04 10:05:51,388 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 35 predicate places. [2025-03-04 10:05:51,388 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 603 flow [2025-03-04 10:05:51,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 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-04 10:05:51,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:51,389 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:51,395 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-04 10:05:51,589 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,SelfDestructingSolverStorable13 [2025-03-04 10:05:51,589 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:51,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1363219501, now seen corresponding path program 1 times [2025-03-04 10:05:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:51,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350730919] [2025-03-04 10:05:51,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:51,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:05:51,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:05:51,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:51,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:05:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350730919] [2025-03-04 10:05:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350730919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:51,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349628474] [2025-03-04 10:05:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:05:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:51,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:05:51,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:05:51,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 105 [2025-03-04 10:05:51,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 128 transitions, 603 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:51,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:51,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 105 [2025-03-04 10:05:51,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:51,993 INFO L124 PetriNetUnfolderBase]: 2648/5215 cut-off events. [2025-03-04 10:05:51,993 INFO L125 PetriNetUnfolderBase]: For 2015/2015 co-relation queries the response was YES. [2025-03-04 10:05:52,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 5215 events. 2648/5215 cut-off events. For 2015/2015 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39826 event pairs, 1496 based on Foata normal form. 144/4263 useless extension candidates. Maximal degree in co-relation 9281. Up to 3556 conditions per place. [2025-03-04 10:05:52,009 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 57 selfloop transitions, 16 changer transitions 0/124 dead transitions. [2025-03-04 10:05:52,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 741 flow [2025-03-04 10:05:52,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 324 transitions. [2025-03-04 10:05:52,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-03-04 10:05:52,010 INFO L175 Difference]: Start difference. First operand has 131 places, 128 transitions, 603 flow. Second operand 5 states and 324 transitions. [2025-03-04 10:05:52,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 741 flow [2025-03-04 10:05:52,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 124 transitions, 722 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 10:05:52,016 INFO L231 Difference]: Finished difference. Result has 128 places, 124 transitions, 608 flow [2025-03-04 10:05:52,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=608, PETRI_PLACES=128, PETRI_TRANSITIONS=124} [2025-03-04 10:05:52,017 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 32 predicate places. [2025-03-04 10:05:52,017 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 124 transitions, 608 flow [2025-03-04 10:05:52,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:05:52,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:52,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:52,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:05:52,017 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:52,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -91282022, now seen corresponding path program 1 times [2025-03-04 10:05:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495256369] [2025-03-04 10:05:52,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:52,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:05:52,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:05:52,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:52,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495256369] [2025-03-04 10:05:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495256369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258865190] [2025-03-04 10:05:52,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:52,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:52,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:52,141 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-04 10:05:52,145 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-04 10:05:52,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:05:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:05:52,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:52,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:52,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:05:52,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:52,211 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-04 10:05:52,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:05:52,247 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 16 treesize of output 11 [2025-03-04 10:05:52,252 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:05:52,252 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-04 10:05:52,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:52,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:52,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-03-04 10:05:52,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:05:52,411 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 34 treesize of output 39 [2025-03-04 10:05:52,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258865190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:52,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:52,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:05:52,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391820708] [2025-03-04 10:05:52,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:52,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:05:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:52,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:05:52,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:05:52,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 105 [2025-03-04 10:05:52,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 124 transitions, 608 flow. Second operand has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 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-04 10:05:52,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:52,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 105 [2025-03-04 10:05:52,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:53,521 INFO L124 PetriNetUnfolderBase]: 3389/6971 cut-off events. [2025-03-04 10:05:53,521 INFO L125 PetriNetUnfolderBase]: For 3763/4078 co-relation queries the response was YES. [2025-03-04 10:05:53,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13581 conditions, 6971 events. 3389/6971 cut-off events. For 3763/4078 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 57765 event pairs, 985 based on Foata normal form. 0/5227 useless extension candidates. Maximal degree in co-relation 11873. Up to 1934 conditions per place. [2025-03-04 10:05:53,540 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 129 selfloop transitions, 29 changer transitions 0/209 dead transitions. [2025-03-04 10:05:53,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 209 transitions, 1164 flow [2025-03-04 10:05:53,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:05:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:05:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 726 transitions. [2025-03-04 10:05:53,541 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2025-03-04 10:05:53,541 INFO L175 Difference]: Start difference. First operand has 128 places, 124 transitions, 608 flow. Second operand 10 states and 726 transitions. [2025-03-04 10:05:53,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 209 transitions, 1164 flow [2025-03-04 10:05:53,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 209 transitions, 1144 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:05:53,545 INFO L231 Difference]: Finished difference. Result has 138 places, 128 transitions, 688 flow [2025-03-04 10:05:53,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=688, PETRI_PLACES=138, PETRI_TRANSITIONS=128} [2025-03-04 10:05:53,545 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 42 predicate places. [2025-03-04 10:05:53,545 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 128 transitions, 688 flow [2025-03-04 10:05:53,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 61.833333333333336) internal successors, (742), 12 states have internal predecessors, (742), 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-04 10:05:53,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:53,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:53,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:05:53,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:05:53,747 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:53,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1336767970, now seen corresponding path program 1 times [2025-03-04 10:05:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:53,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375897617] [2025-03-04 10:05:53,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:53,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:05:53,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:05:53,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:53,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:05:53,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:53,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375897617] [2025-03-04 10:05:53,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375897617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:53,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:05:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481190695] [2025-03-04 10:05:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:53,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:05:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:53,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:05:53,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:05:53,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 105 [2025-03-04 10:05:53,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 128 transitions, 688 flow. Second operand has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-04 10:05:53,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:53,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 105 [2025-03-04 10:05:53,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:54,341 INFO L124 PetriNetUnfolderBase]: 3492/7667 cut-off events. [2025-03-04 10:05:54,341 INFO L125 PetriNetUnfolderBase]: For 5114/5558 co-relation queries the response was YES. [2025-03-04 10:05:54,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15436 conditions, 7667 events. 3492/7667 cut-off events. For 5114/5558 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 67511 event pairs, 1481 based on Foata normal form. 30/6154 useless extension candidates. Maximal degree in co-relation 13581. Up to 2650 conditions per place. [2025-03-04 10:05:54,373 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 111 selfloop transitions, 13 changer transitions 0/181 dead transitions. [2025-03-04 10:05:54,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 181 transitions, 1113 flow [2025-03-04 10:05:54,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:05:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:05:54,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 413 transitions. [2025-03-04 10:05:54,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2025-03-04 10:05:54,375 INFO L175 Difference]: Start difference. First operand has 138 places, 128 transitions, 688 flow. Second operand 5 states and 413 transitions. [2025-03-04 10:05:54,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 181 transitions, 1113 flow [2025-03-04 10:05:54,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 181 transitions, 1078 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:05:54,380 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 698 flow [2025-03-04 10:05:54,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=698, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2025-03-04 10:05:54,380 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 44 predicate places. [2025-03-04 10:05:54,381 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 698 flow [2025-03-04 10:05:54,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.4) internal successors, (337), 5 states have internal predecessors, (337), 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-04 10:05:54,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:54,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:54,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:05:54,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:54,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:54,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1465225237, now seen corresponding path program 1 times [2025-03-04 10:05:54,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:54,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547632204] [2025-03-04 10:05:54,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:54,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:54,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:05:54,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:05:54,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:54,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547632204] [2025-03-04 10:05:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547632204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656423112] [2025-03-04 10:05:54,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:54,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:54,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:54,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:54,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:05:54,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:05:54,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:05:54,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:54,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:54,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:05:54,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:54,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:54,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:05:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656423112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:54,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:54,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 10:05:54,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329108678] [2025-03-04 10:05:54,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:54,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:05:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:54,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:05:54,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:05:54,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2025-03-04 10:05:54,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 698 flow. Second operand has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 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-04 10:05:54,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:54,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2025-03-04 10:05:54,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:55,512 INFO L124 PetriNetUnfolderBase]: 4147/8251 cut-off events. [2025-03-04 10:05:55,512 INFO L125 PetriNetUnfolderBase]: For 6108/6531 co-relation queries the response was YES. [2025-03-04 10:05:55,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17985 conditions, 8251 events. 4147/8251 cut-off events. For 6108/6531 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 68220 event pairs, 1211 based on Foata normal form. 0/7221 useless extension candidates. Maximal degree in co-relation 16093. Up to 2183 conditions per place. [2025-03-04 10:05:55,535 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 128 selfloop transitions, 29 changer transitions 0/212 dead transitions. [2025-03-04 10:05:55,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 212 transitions, 1274 flow [2025-03-04 10:05:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:05:55,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:05:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2025-03-04 10:05:55,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7511904761904762 [2025-03-04 10:05:55,537 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 698 flow. Second operand 8 states and 631 transitions. [2025-03-04 10:05:55,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 212 transitions, 1274 flow [2025-03-04 10:05:55,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 212 transitions, 1259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:05:55,544 INFO L231 Difference]: Finished difference. Result has 149 places, 132 transitions, 783 flow [2025-03-04 10:05:55,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=783, PETRI_PLACES=149, PETRI_TRANSITIONS=132} [2025-03-04 10:05:55,544 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 53 predicate places. [2025-03-04 10:05:55,544 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 132 transitions, 783 flow [2025-03-04 10:05:55,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 65.33333333333333) internal successors, (784), 12 states have internal predecessors, (784), 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-04 10:05:55,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:55,545 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:55,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:05:55,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:55,745 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:55,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:55,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1465225236, now seen corresponding path program 1 times [2025-03-04 10:05:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:55,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315459145] [2025-03-04 10:05:55,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:55,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:05:55,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:05:55,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:55,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:55,775 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-04 10:05:55,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:55,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315459145] [2025-03-04 10:05:55,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315459145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:05:55,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:05:55,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:05:55,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489642817] [2025-03-04 10:05:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:05:55,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:05:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:55,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:05:55,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:05:55,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 105 [2025-03-04 10:05:55,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 132 transitions, 783 flow. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-04 10:05:55,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:05:55,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 105 [2025-03-04 10:05:55,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:05:56,319 INFO L124 PetriNetUnfolderBase]: 4344/8984 cut-off events. [2025-03-04 10:05:56,319 INFO L125 PetriNetUnfolderBase]: For 8676/9120 co-relation queries the response was YES. [2025-03-04 10:05:56,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20319 conditions, 8984 events. 4344/8984 cut-off events. For 8676/9120 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 77253 event pairs, 2985 based on Foata normal form. 265/8456 useless extension candidates. Maximal degree in co-relation 18322. Up to 6219 conditions per place. [2025-03-04 10:05:56,352 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 63 selfloop transitions, 13 changer transitions 0/128 dead transitions. [2025-03-04 10:05:56,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 128 transitions, 927 flow [2025-03-04 10:05:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:05:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:05:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2025-03-04 10:05:56,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6452380952380953 [2025-03-04 10:05:56,353 INFO L175 Difference]: Start difference. First operand has 149 places, 132 transitions, 783 flow. Second operand 4 states and 271 transitions. [2025-03-04 10:05:56,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 128 transitions, 927 flow [2025-03-04 10:05:56,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 128 transitions, 889 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:05:56,364 INFO L231 Difference]: Finished difference. Result has 145 places, 128 transitions, 763 flow [2025-03-04 10:05:56,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=763, PETRI_PLACES=145, PETRI_TRANSITIONS=128} [2025-03-04 10:05:56,364 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 49 predicate places. [2025-03-04 10:05:56,364 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 128 transitions, 763 flow [2025-03-04 10:05:56,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 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-04 10:05:56,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:05:56,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:05:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:05:56,365 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2025-03-04 10:05:56,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:05:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1785708291, now seen corresponding path program 1 times [2025-03-04 10:05:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:05:56,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154875459] [2025-03-04 10:05:56,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:56,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:05:56,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:05:56,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:05:56,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:56,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:56,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:05:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154875459] [2025-03-04 10:05:56,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154875459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:05:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224520698] [2025-03-04 10:05:56,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:05:56,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:05:56,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:05:56,562 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:05:56,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:05:56,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:05:56,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:05:56,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:05:56,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:05:56,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:05:56,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:05:56,626 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-04 10:05:56,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:05:56,652 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 14 treesize of output 9 [2025-03-04 10:05:56,657 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:05:56,657 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-04 10:05:56,669 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:05:56,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:05:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:56,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:05:57,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2025-03-04 10:05:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:05:57,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224520698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:05:57,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:05:57,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 12 [2025-03-04 10:05:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195627643] [2025-03-04 10:05:57,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:05:57,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:05:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:05:57,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:05:57,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=141, Unknown=1, NotChecked=0, Total=182 [2025-03-04 10:06:01,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:05,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:09,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:13,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:17,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:21,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:25,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:29,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:06:33,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]