./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.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 14a9c1cac7f040ebf84fc8e1c821294cab75b8332a1643f6e05ef67dfff453ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:27:06,024 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:27:06,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:27:06,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:27:06,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:27:06,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:27:06,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:27:06,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:27:06,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:27:06,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:27:06,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:27:06,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:27:06,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:27:06,093 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:27:06,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:27:06,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:27:06,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:27:06,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:27:06,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:27:06,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:27:06,095 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:27:06,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:27:06,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:27:06,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:27:06,096 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 -> 14a9c1cac7f040ebf84fc8e1c821294cab75b8332a1643f6e05ef67dfff453ec [2025-03-17 14:27:06,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:27:06,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:27:06,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:27:06,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:27:06,314 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:27:06,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2025-03-17 14:27:07,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6595f280a/d9bcabb1412f4d2e89c50943befb8c36/FLAGe9fc2d778 [2025-03-17 14:27:07,722 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:27:07,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-counter-queue2.wvr.c [2025-03-17 14:27:07,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6595f280a/d9bcabb1412f4d2e89c50943befb8c36/FLAGe9fc2d778 [2025-03-17 14:27:08,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6595f280a/d9bcabb1412f4d2e89c50943befb8c36 [2025-03-17 14:27:08,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:27:08,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:27:08,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:27:08,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:27:08,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:27:08,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffe2b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08, skipping insertion in model container [2025-03-17 14:27:08,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:27:08,173 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:27:08,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:27:08,191 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:27:08,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:27:08,228 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:27:08,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08 WrapperNode [2025-03-17 14:27:08,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:27:08,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:27:08,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:27:08,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:27:08,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,258 INFO L138 Inliner]: procedures = 25, calls = 27, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 125 [2025-03-17 14:27:08,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:27:08,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:27:08,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:27:08,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:27:08,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,285 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-17 14:27:08,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:27:08,299 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:27:08,299 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:27:08,299 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:27:08,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (1/1) ... [2025-03-17 14:27:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:27:08,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:08,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:27:08,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:27:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:27:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:27:08,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:27:08,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:27:08,359 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:27:08,429 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:27:08,431 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:27:08,693 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:27:08,693 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:27:08,833 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:27:08,833 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:27:08,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:27:08 BoogieIcfgContainer [2025-03-17 14:27:08,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:27:08,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:27:08,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:27:08,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:27:08,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:27:08" (1/3) ... [2025-03-17 14:27:08,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355f4a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:27:08, skipping insertion in model container [2025-03-17 14:27:08,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:27:08" (2/3) ... [2025-03-17 14:27:08,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355f4a06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:27:08, skipping insertion in model container [2025-03-17 14:27:08,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:27:08" (3/3) ... [2025-03-17 14:27:08,843 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue2.wvr.c [2025-03-17 14:27:08,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:27:08,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue2.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-17 14:27:08,855 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:27:08,903 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:27:08,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 80 flow [2025-03-17 14:27:08,953 INFO L124 PetriNetUnfolderBase]: 3/31 cut-off events. [2025-03-17 14:27:08,955 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:27:08,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 31 events. 3/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 53 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-03-17 14:27:08,958 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 33 transitions, 80 flow [2025-03-17 14:27:08,961 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 30 transitions, 72 flow [2025-03-17 14:27:08,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:27:08,982 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;@61f0995b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:27:08,983 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-03-17 14:27:08,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:27:08,987 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:27:08,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:27:08,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:08,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:27:08,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:08,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:08,993 INFO L85 PathProgramCache]: Analyzing trace with hash 382415, now seen corresponding path program 1 times [2025-03-17 14:27:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394078133] [2025-03-17 14:27:08,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:09,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:27:09,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:27:09,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:09,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:09,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:09,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394078133] [2025-03-17 14:27:09,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394078133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:09,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:09,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:27:09,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664043236] [2025-03-17 14:27:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:09,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:27:09,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:09,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:27:09,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:27:09,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:09,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:09,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:09,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:09,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:09,317 INFO L124 PetriNetUnfolderBase]: 128/232 cut-off events. [2025-03-17 14:27:09,317 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 14:27:09,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 232 events. 128/232 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 958 event pairs, 100 based on Foata normal form. 1/171 useless extension candidates. Maximal degree in co-relation 427. Up to 221 conditions per place. [2025-03-17 14:27:09,321 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 21 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-03-17 14:27:09,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 112 flow [2025-03-17 14:27:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:27:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:27:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-17 14:27:09,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2025-03-17 14:27:09,333 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 72 flow. Second operand 3 states and 46 transitions. [2025-03-17 14:27:09,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 112 flow [2025-03-17 14:27:09,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:09,338 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 62 flow [2025-03-17 14:27:09,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2025-03-17 14:27:09,345 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-03-17 14:27:09,345 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 62 flow [2025-03-17 14:27:09,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:09,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:09,345 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:27:09,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:27:09,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:09,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:09,347 INFO L85 PathProgramCache]: Analyzing trace with hash 382416, now seen corresponding path program 1 times [2025-03-17 14:27:09,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:09,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301698599] [2025-03-17 14:27:09,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:09,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:09,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:27:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:27:09,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:09,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:09,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:09,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301698599] [2025-03-17 14:27:09,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301698599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:09,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:09,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:09,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131464142] [2025-03-17 14:27:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:09,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:09,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:09,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:09,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:09,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:09,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:09,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:09,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:09,652 INFO L124 PetriNetUnfolderBase]: 129/235 cut-off events. [2025-03-17 14:27:09,653 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:27:09,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 235 events. 129/235 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 986 event pairs, 100 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 453. Up to 226 conditions per place. [2025-03-17 14:27:09,655 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-03-17 14:27:09,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 124 flow [2025-03-17 14:27:09,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:09,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-03-17 14:27:09,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2025-03-17 14:27:09,657 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 62 flow. Second operand 4 states and 56 transitions. [2025-03-17 14:27:09,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 124 flow [2025-03-17 14:27:09,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:09,659 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 85 flow [2025-03-17 14:27:09,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2025-03-17 14:27:09,660 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2025-03-17 14:27:09,660 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 85 flow [2025-03-17 14:27:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:09,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:09,661 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:27:09,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:27:09,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:09,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash 367514207, now seen corresponding path program 1 times [2025-03-17 14:27:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228078498] [2025-03-17 14:27:09,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:09,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:27:09,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:27:09,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:09,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:09,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228078498] [2025-03-17 14:27:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228078498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023558557] [2025-03-17 14:27:09,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:09,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:09,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:09,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:09,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:27:09,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:27:10,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:27:10,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:10,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:10,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:27:10,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:10,054 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-17 14:27:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:10,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:10,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023558557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:10,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:10,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:27:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643783449] [2025-03-17 14:27:10,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:10,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:27:10,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:10,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:27:10,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:27:10,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:10,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 85 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:10,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:10,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:10,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:10,500 INFO L124 PetriNetUnfolderBase]: 129/234 cut-off events. [2025-03-17 14:27:10,501 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:27:10,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 234 events. 129/234 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 978 event pairs, 100 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 460. Up to 222 conditions per place. [2025-03-17 14:27:10,503 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-03-17 14:27:10,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 133 flow [2025-03-17 14:27:10,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:27:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:27:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-03-17 14:27:10,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2025-03-17 14:27:10,504 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 85 flow. Second operand 6 states and 69 transitions. [2025-03-17 14:27:10,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 133 flow [2025-03-17 14:27:10,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:10,505 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 92 flow [2025-03-17 14:27:10,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2025-03-17 14:27:10,505 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-03-17 14:27:10,505 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 92 flow [2025-03-17 14:27:10,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:10,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:10,505 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:27:10,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:10,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:10,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:10,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1489806631, now seen corresponding path program 1 times [2025-03-17 14:27:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395828605] [2025-03-17 14:27:10,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:10,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:27:10,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:27:10,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:10,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:10,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:10,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395828605] [2025-03-17 14:27:10,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395828605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:10,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:10,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:10,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346672938] [2025-03-17 14:27:10,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:10,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:27:10,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:10,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:27:10,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:27:10,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:10,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:10,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:10,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:10,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:10,829 INFO L124 PetriNetUnfolderBase]: 93/172 cut-off events. [2025-03-17 14:27:10,829 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 14:27:10,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 172 events. 93/172 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 615 event pairs, 68 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 337. Up to 160 conditions per place. [2025-03-17 14:27:10,830 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 21 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2025-03-17 14:27:10,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 136 flow [2025-03-17 14:27:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:27:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:27:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-03-17 14:27:10,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-03-17 14:27:10,834 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 92 flow. Second operand 4 states and 51 transitions. [2025-03-17 14:27:10,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 136 flow [2025-03-17 14:27:10,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 106 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-17 14:27:10,835 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 64 flow [2025-03-17 14:27:10,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2025-03-17 14:27:10,836 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2025-03-17 14:27:10,836 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 64 flow [2025-03-17 14:27:10,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:10,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:10,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:27:10,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:27:10,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1489806630, now seen corresponding path program 1 times [2025-03-17 14:27:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757908710] [2025-03-17 14:27:10,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:10,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:27:10,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:27:10,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:10,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:10,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757908710] [2025-03-17 14:27:10,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757908710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:10,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:10,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:27:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993046003] [2025-03-17 14:27:10,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:10,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:10,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:10,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:10,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:10,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:10,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:10,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:10,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:10,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:11,008 INFO L124 PetriNetUnfolderBase]: 154/292 cut-off events. [2025-03-17 14:27:11,008 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:27:11,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 292 events. 154/292 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1151 event pairs, 106 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 388. Up to 192 conditions per place. [2025-03-17 14:27:11,010 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 42 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2025-03-17 14:27:11,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 49 transitions, 207 flow [2025-03-17 14:27:11,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:11,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-03-17 14:27:11,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2025-03-17 14:27:11,011 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 64 flow. Second operand 5 states and 83 transitions. [2025-03-17 14:27:11,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 49 transitions, 207 flow [2025-03-17 14:27:11,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 49 transitions, 203 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:11,012 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 85 flow [2025-03-17 14:27:11,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2025-03-17 14:27:11,013 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2025-03-17 14:27:11,013 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 85 flow [2025-03-17 14:27:11,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:11,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:11,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:11,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:27:11,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:11,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1482340851, now seen corresponding path program 1 times [2025-03-17 14:27:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371314273] [2025-03-17 14:27:11,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:11,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:27:11,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:27:11,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:11,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371314273] [2025-03-17 14:27:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371314273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:27:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985955136] [2025-03-17 14:27:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:11,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:11,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:27:11,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:11,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:11,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:11,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:11,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:11,154 INFO L124 PetriNetUnfolderBase]: 130/247 cut-off events. [2025-03-17 14:27:11,155 INFO L125 PetriNetUnfolderBase]: For 73/84 co-relation queries the response was YES. [2025-03-17 14:27:11,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 247 events. 130/247 cut-off events. For 73/84 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 899 event pairs, 96 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 416. Up to 190 conditions per place. [2025-03-17 14:27:11,156 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 35 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2025-03-17 14:27:11,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 204 flow [2025-03-17 14:27:11,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:11,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-17 14:27:11,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-03-17 14:27:11,158 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 85 flow. Second operand 5 states and 76 transitions. [2025-03-17 14:27:11,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 204 flow [2025-03-17 14:27:11,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:11,159 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 105 flow [2025-03-17 14:27:11,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2025-03-17 14:27:11,159 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2025-03-17 14:27:11,159 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 105 flow [2025-03-17 14:27:11,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:11,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:11,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:11,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:27:11,160 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:11,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:11,160 INFO L85 PathProgramCache]: Analyzing trace with hash 746643435, now seen corresponding path program 1 times [2025-03-17 14:27:11,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:11,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302619389] [2025-03-17 14:27:11,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:11,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:11,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:27:11,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:27:11,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:11,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:11,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302619389] [2025-03-17 14:27:11,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302619389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:11,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923031915] [2025-03-17 14:27:11,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:11,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:11,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:11,287 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:11,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:27:11,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 14:27:11,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 14:27:11,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:11,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:11,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:27:11,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:11,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:11,433 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 22 treesize of output 18 [2025-03-17 14:27:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:11,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923031915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:11,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:11,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:27:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662233586] [2025-03-17 14:27:11,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:11,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:27:11,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:11,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:27:11,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:27:11,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:11,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 105 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:11,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:11,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:11,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:11,673 INFO L124 PetriNetUnfolderBase]: 160/310 cut-off events. [2025-03-17 14:27:11,673 INFO L125 PetriNetUnfolderBase]: For 113/127 co-relation queries the response was YES. [2025-03-17 14:27:11,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 310 events. 160/310 cut-off events. For 113/127 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1213 event pairs, 65 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 582. Up to 142 conditions per place. [2025-03-17 14:27:11,675 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 45 selfloop transitions, 9 changer transitions 0/57 dead transitions. [2025-03-17 14:27:11,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 281 flow [2025-03-17 14:27:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:27:11,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:27:11,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2025-03-17 14:27:11,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2025-03-17 14:27:11,679 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 105 flow. Second operand 7 states and 111 transitions. [2025-03-17 14:27:11,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 281 flow [2025-03-17 14:27:11,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 57 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:11,681 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 141 flow [2025-03-17 14:27:11,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=141, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-03-17 14:27:11,681 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2025-03-17 14:27:11,681 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 141 flow [2025-03-17 14:27:11,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:11,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:11,681 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:11,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:11,887 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,SelfDestructingSolverStorable6 [2025-03-17 14:27:11,887 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 262523614, now seen corresponding path program 1 times [2025-03-17 14:27:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702925079] [2025-03-17 14:27:11,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:11,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:11,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:11,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:11,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702925079] [2025-03-17 14:27:12,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702925079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:12,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168712123] [2025-03-17 14:27:12,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:12,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:12,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:12,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:12,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:27:12,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 14:27:12,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 14:27:12,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:12,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:12,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:27:12,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:12,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:12,161 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 22 treesize of output 18 [2025-03-17 14:27:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:12,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168712123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:12,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:12,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-17 14:27:12,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416517433] [2025-03-17 14:27:12,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:12,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:27:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:12,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:27:12,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:27:12,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:12,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 141 flow. Second operand has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:12,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:12,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:12,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:12,464 INFO L124 PetriNetUnfolderBase]: 223/416 cut-off events. [2025-03-17 14:27:12,464 INFO L125 PetriNetUnfolderBase]: For 400/426 co-relation queries the response was YES. [2025-03-17 14:27:12,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1204 conditions, 416 events. 223/416 cut-off events. For 400/426 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1611 event pairs, 100 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 1006. Up to 205 conditions per place. [2025-03-17 14:27:12,466 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 52 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2025-03-17 14:27:12,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 391 flow [2025-03-17 14:27:12,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:27:12,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:27:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-03-17 14:27:12,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47186147186147187 [2025-03-17 14:27:12,468 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 141 flow. Second operand 7 states and 109 transitions. [2025-03-17 14:27:12,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 391 flow [2025-03-17 14:27:12,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 64 transitions, 375 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:12,470 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 170 flow [2025-03-17 14:27:12,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2025-03-17 14:27:12,470 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-03-17 14:27:12,470 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 170 flow [2025-03-17 14:27:12,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.818181818181818) internal successors, (108), 11 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:12,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:12,471 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:12,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:12,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:12,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:12,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:12,672 INFO L85 PathProgramCache]: Analyzing trace with hash -380652883, now seen corresponding path program 1 times [2025-03-17 14:27:12,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822499151] [2025-03-17 14:27:12,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:12,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:27:12,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:27:12,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:12,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:12,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822499151] [2025-03-17 14:27:12,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822499151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:12,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958572031] [2025-03-17 14:27:12,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:12,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:12,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:12,742 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:12,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:27:12,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:27:12,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:27:12,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:12,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:12,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:27:12,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:12,844 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:12,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:12,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958572031] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:12,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:27:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840602559] [2025-03-17 14:27:12,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:12,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:27:12,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:12,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:27:12,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:12,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:12,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 170 flow. Second operand has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:12,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:12,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:12,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:13,085 INFO L124 PetriNetUnfolderBase]: 432/763 cut-off events. [2025-03-17 14:27:13,085 INFO L125 PetriNetUnfolderBase]: For 953/980 co-relation queries the response was YES. [2025-03-17 14:27:13,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 763 events. 432/763 cut-off events. For 953/980 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3239 event pairs, 226 based on Foata normal form. 16/778 useless extension candidates. Maximal degree in co-relation 1404. Up to 407 conditions per place. [2025-03-17 14:27:13,090 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 70 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2025-03-17 14:27:13,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 564 flow [2025-03-17 14:27:13,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:27:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:27:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2025-03-17 14:27:13,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45075757575757575 [2025-03-17 14:27:13,091 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 170 flow. Second operand 8 states and 119 transitions. [2025-03-17 14:27:13,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 564 flow [2025-03-17 14:27:13,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 543 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:13,095 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 256 flow [2025-03-17 14:27:13,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-03-17 14:27:13,095 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2025-03-17 14:27:13,096 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 256 flow [2025-03-17 14:27:13,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.0) internal successors, (126), 14 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:13,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:13,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:13,103 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-17 14:27:13,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:13,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:13,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash -294053375, now seen corresponding path program 1 times [2025-03-17 14:27:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97970803] [2025-03-17 14:27:13,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:13,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:13,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:27:13,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:27:13,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:13,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97970803] [2025-03-17 14:27:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97970803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707978998] [2025-03-17 14:27:13,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:13,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:13,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:13,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:13,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:27:13,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:27:13,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:27:13,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:13,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:13,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:27:13,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:13,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707978998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:13,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:13,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-17 14:27:13,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586618597] [2025-03-17 14:27:13,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:13,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:27:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:13,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:27:13,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:13,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:13,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 256 flow. Second operand has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:13,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:13,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:13,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:13,764 INFO L124 PetriNetUnfolderBase]: 378/660 cut-off events. [2025-03-17 14:27:13,764 INFO L125 PetriNetUnfolderBase]: For 1382/1438 co-relation queries the response was YES. [2025-03-17 14:27:13,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 660 events. 378/660 cut-off events. For 1382/1438 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2636 event pairs, 218 based on Foata normal form. 11/671 useless extension candidates. Maximal degree in co-relation 1437. Up to 403 conditions per place. [2025-03-17 14:27:13,771 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 59 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2025-03-17 14:27:13,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 576 flow [2025-03-17 14:27:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:27:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:27:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2025-03-17 14:27:13,773 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-17 14:27:13,773 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 256 flow. Second operand 8 states and 114 transitions. [2025-03-17 14:27:13,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 576 flow [2025-03-17 14:27:13,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 561 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-17 14:27:13,778 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 325 flow [2025-03-17 14:27:13,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-03-17 14:27:13,778 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2025-03-17 14:27:13,779 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 325 flow [2025-03-17 14:27:13,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:13,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:13,779 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:13,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:13,979 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,SelfDestructingSolverStorable9 [2025-03-17 14:27:13,979 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:13,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:13,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1112559556, now seen corresponding path program 2 times [2025-03-17 14:27:13,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:13,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095137521] [2025-03-17 14:27:13,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:13,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:13,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 14:27:14,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:27:14,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:14,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:27:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095137521] [2025-03-17 14:27:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095137521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233584712] [2025-03-17 14:27:14,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:14,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:14,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:14,183 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:14,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:27:14,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 14:27:14,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:27:14,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:14,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:14,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:27:14,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:14,242 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-17 14:27:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:14,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:14,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233584712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:14,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-17 14:27:14,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092998223] [2025-03-17 14:27:14,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:14,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:27:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:14,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:27:14,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:27:14,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:14,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 325 flow. Second operand has 20 states, 20 states have (on average 7.9) internal successors, (158), 20 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:14,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:14,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:14,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:15,260 INFO L124 PetriNetUnfolderBase]: 447/769 cut-off events. [2025-03-17 14:27:15,260 INFO L125 PetriNetUnfolderBase]: For 2104/2166 co-relation queries the response was YES. [2025-03-17 14:27:15,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3053 conditions, 769 events. 447/769 cut-off events. For 2104/2166 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3063 event pairs, 76 based on Foata normal form. 32/800 useless extension candidates. Maximal degree in co-relation 1938. Up to 132 conditions per place. [2025-03-17 14:27:15,265 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 109 selfloop transitions, 21 changer transitions 0/132 dead transitions. [2025-03-17 14:27:15,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 132 transitions, 1056 flow [2025-03-17 14:27:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:27:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:27:15,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 191 transitions. [2025-03-17 14:27:15,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4134199134199134 [2025-03-17 14:27:15,268 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 325 flow. Second operand 14 states and 191 transitions. [2025-03-17 14:27:15,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 132 transitions, 1056 flow [2025-03-17 14:27:15,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 1028 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:15,274 INFO L231 Difference]: Finished difference. Result has 74 places, 51 transitions, 385 flow [2025-03-17 14:27:15,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=385, PETRI_PLACES=74, PETRI_TRANSITIONS=51} [2025-03-17 14:27:15,276 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2025-03-17 14:27:15,276 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 51 transitions, 385 flow [2025-03-17 14:27:15,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.9) internal successors, (158), 20 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:15,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:15,278 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:15,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:27:15,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:15,479 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:15,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:15,479 INFO L85 PathProgramCache]: Analyzing trace with hash -980083392, now seen corresponding path program 1 times [2025-03-17 14:27:15,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:15,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907853499] [2025-03-17 14:27:15,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:15,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:15,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:27:15,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:27:15,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:15,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:15,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:27:15,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:15,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907853499] [2025-03-17 14:27:15,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907853499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:27:15,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:27:15,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:27:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561575038] [2025-03-17 14:27:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:15,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:27:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:15,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:27:15,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:27:15,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:15,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 51 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:15,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:15,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:15,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:15,581 INFO L124 PetriNetUnfolderBase]: 375/708 cut-off events. [2025-03-17 14:27:15,581 INFO L125 PetriNetUnfolderBase]: For 2747/2819 co-relation queries the response was YES. [2025-03-17 14:27:15,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 708 events. 375/708 cut-off events. For 2747/2819 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2973 event pairs, 102 based on Foata normal form. 3/710 useless extension candidates. Maximal degree in co-relation 1872. Up to 489 conditions per place. [2025-03-17 14:27:15,585 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 52 selfloop transitions, 3 changer transitions 6/66 dead transitions. [2025-03-17 14:27:15,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 66 transitions, 618 flow [2025-03-17 14:27:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:27:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:27:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-03-17 14:27:15,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2025-03-17 14:27:15,586 INFO L175 Difference]: Start difference. First operand has 74 places, 51 transitions, 385 flow. Second operand 3 states and 56 transitions. [2025-03-17 14:27:15,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 66 transitions, 618 flow [2025-03-17 14:27:15,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 538 flow, removed 13 selfloop flow, removed 10 redundant places. [2025-03-17 14:27:15,590 INFO L231 Difference]: Finished difference. Result has 67 places, 48 transitions, 302 flow [2025-03-17 14:27:15,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=67, PETRI_TRANSITIONS=48} [2025-03-17 14:27:15,591 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2025-03-17 14:27:15,591 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 48 transitions, 302 flow [2025-03-17 14:27:15,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:15,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:15,591 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:15,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:27:15,591 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:15,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash 718270416, now seen corresponding path program 2 times [2025-03-17 14:27:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712458536] [2025-03-17 14:27:15,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:15,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 14:27:15,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:27:15,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:15,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-17 14:27:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712458536] [2025-03-17 14:27:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712458536] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980217233] [2025-03-17 14:27:15,722 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:15,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:15,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:15,723 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-17 14:27:15,725 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-17 14:27:15,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-17 14:27:15,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:27:15,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:15,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:15,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 14:27:15,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:15,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:15,958 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 24 treesize of output 20 [2025-03-17 14:27:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980217233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:16,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:16,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-17 14:27:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619339394] [2025-03-17 14:27:16,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:16,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:27:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:16,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:27:16,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:27:16,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:16,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 48 transitions, 302 flow. Second operand has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:16,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:16,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:16,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:16,673 INFO L124 PetriNetUnfolderBase]: 506/852 cut-off events. [2025-03-17 14:27:16,673 INFO L125 PetriNetUnfolderBase]: For 2048/2121 co-relation queries the response was YES. [2025-03-17 14:27:16,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3380 conditions, 852 events. 506/852 cut-off events. For 2048/2121 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3497 event pairs, 92 based on Foata normal form. 34/884 useless extension candidates. Maximal degree in co-relation 2424. Up to 167 conditions per place. [2025-03-17 14:27:16,678 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 109 selfloop transitions, 18 changer transitions 0/131 dead transitions. [2025-03-17 14:27:16,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 131 transitions, 1047 flow [2025-03-17 14:27:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 14:27:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-17 14:27:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 192 transitions. [2025-03-17 14:27:16,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2025-03-17 14:27:16,679 INFO L175 Difference]: Start difference. First operand has 67 places, 48 transitions, 302 flow. Second operand 14 states and 192 transitions. [2025-03-17 14:27:16,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 131 transitions, 1047 flow [2025-03-17 14:27:16,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 131 transitions, 964 flow, removed 24 selfloop flow, removed 4 redundant places. [2025-03-17 14:27:16,684 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 337 flow [2025-03-17 14:27:16,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=337, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2025-03-17 14:27:16,684 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 39 predicate places. [2025-03-17 14:27:16,684 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 337 flow [2025-03-17 14:27:16,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:16,685 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:16,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:16,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:27:16,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:16,885 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:16,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:16,886 INFO L85 PathProgramCache]: Analyzing trace with hash 361208838, now seen corresponding path program 1 times [2025-03-17 14:27:16,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:16,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651134412] [2025-03-17 14:27:16,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:16,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:16,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:27:16,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:27:16,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:16,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:16,954 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-17 14:27:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:16,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651134412] [2025-03-17 14:27:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651134412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457585821] [2025-03-17 14:27:16,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:16,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:16,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:16,957 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-17 14:27:16,958 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-17 14:27:16,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:27:17,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:27:17,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:17,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:17,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:27:17,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:17,028 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-17 14:27:17,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:17,058 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:17,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457585821] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:17,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:27:17,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-17 14:27:17,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099157223] [2025-03-17 14:27:17,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:17,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:17,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:17,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:17,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:27:17,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:17,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:17,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:17,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:17,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:17,147 INFO L124 PetriNetUnfolderBase]: 462/798 cut-off events. [2025-03-17 14:27:17,147 INFO L125 PetriNetUnfolderBase]: For 2385/2402 co-relation queries the response was YES. [2025-03-17 14:27:17,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3262 conditions, 798 events. 462/798 cut-off events. For 2385/2402 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3316 event pairs, 112 based on Foata normal form. 34/812 useless extension candidates. Maximal degree in co-relation 2422. Up to 439 conditions per place. [2025-03-17 14:27:17,152 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 53 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2025-03-17 14:27:17,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 67 transitions, 591 flow [2025-03-17 14:27:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:17,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-03-17 14:27:17,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-17 14:27:17,153 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 337 flow. Second operand 5 states and 65 transitions. [2025-03-17 14:27:17,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 67 transitions, 591 flow [2025-03-17 14:27:17,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 499 flow, removed 15 selfloop flow, removed 11 redundant places. [2025-03-17 14:27:17,157 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 309 flow [2025-03-17 14:27:17,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=309, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2025-03-17 14:27:17,158 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2025-03-17 14:27:17,158 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 309 flow [2025-03-17 14:27:17,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:17,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:17,159 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:17,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:27:17,360 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:17,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash 669090825, now seen corresponding path program 1 times [2025-03-17 14:27:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491806982] [2025-03-17 14:27:17,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:17,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:27:17,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:27:17,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:17,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:17,429 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-17 14:27:17,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491806982] [2025-03-17 14:27:17,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491806982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:17,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113126056] [2025-03-17 14:27:17,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:17,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:17,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:27:17,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:27:17,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:27:17,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:17,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:17,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:27:17,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:17,507 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-17 14:27:17,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:17,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113126056] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:17,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:27:17,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-17 14:27:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983896572] [2025-03-17 14:27:17,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:17,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:27:17,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:17,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:27:17,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:27:17,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:17,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:17,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:17,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:17,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:17,618 INFO L124 PetriNetUnfolderBase]: 416/731 cut-off events. [2025-03-17 14:27:17,619 INFO L125 PetriNetUnfolderBase]: For 2080/2096 co-relation queries the response was YES. [2025-03-17 14:27:17,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2836 conditions, 731 events. 416/731 cut-off events. For 2080/2096 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3007 event pairs, 120 based on Foata normal form. 28/741 useless extension candidates. Maximal degree in co-relation 2193. Up to 383 conditions per place. [2025-03-17 14:27:17,622 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 48 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2025-03-17 14:27:17,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 518 flow [2025-03-17 14:27:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:27:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:27:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-03-17 14:27:17,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-03-17 14:27:17,623 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 309 flow. Second operand 5 states and 64 transitions. [2025-03-17 14:27:17,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 518 flow [2025-03-17 14:27:17,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 495 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-17 14:27:17,626 INFO L231 Difference]: Finished difference. Result has 69 places, 49 transitions, 318 flow [2025-03-17 14:27:17,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=69, PETRI_TRANSITIONS=49} [2025-03-17 14:27:17,627 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2025-03-17 14:27:17,627 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 49 transitions, 318 flow [2025-03-17 14:27:17,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:17,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:17,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:17,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:17,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:27:17,828 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:17,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash -728436266, now seen corresponding path program 1 times [2025-03-17 14:27:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:17,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713903128] [2025-03-17 14:27:17,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:17,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:27:17,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:17,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:17,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:18,093 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-17 14:27:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713903128] [2025-03-17 14:27:18,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713903128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215947145] [2025-03-17 14:27:18,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:27:18,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:18,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:18,095 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:18,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:27:18,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:27:18,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:18,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:18,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:18,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:27:18,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:18,185 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-17 14:27:18,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:18,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:18,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 14 [2025-03-17 14:27:18,236 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-17 14:27:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215947145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:18,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:18,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2025-03-17 14:27:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563821658] [2025-03-17 14:27:18,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:18,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:27:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:18,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:27:18,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:18,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:18,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 49 transitions, 318 flow. Second operand has 14 states, 14 states have (on average 10.5) internal successors, (147), 14 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:18,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:18,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:18,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:18,484 INFO L124 PetriNetUnfolderBase]: 427/853 cut-off events. [2025-03-17 14:27:18,484 INFO L125 PetriNetUnfolderBase]: For 2158/2188 co-relation queries the response was YES. [2025-03-17 14:27:18,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 853 events. 427/853 cut-off events. For 2158/2188 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4163 event pairs, 50 based on Foata normal form. 4/856 useless extension candidates. Maximal degree in co-relation 2437. Up to 468 conditions per place. [2025-03-17 14:27:18,490 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 65 selfloop transitions, 32 changer transitions 16/122 dead transitions. [2025-03-17 14:27:18,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 122 transitions, 960 flow [2025-03-17 14:27:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:27:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:27:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2025-03-17 14:27:18,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-17 14:27:18,491 INFO L175 Difference]: Start difference. First operand has 69 places, 49 transitions, 318 flow. Second operand 12 states and 174 transitions. [2025-03-17 14:27:18,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 122 transitions, 960 flow [2025-03-17 14:27:18,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 122 transitions, 930 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-17 14:27:18,496 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 629 flow [2025-03-17 14:27:18,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=629, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2025-03-17 14:27:18,498 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2025-03-17 14:27:18,498 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 629 flow [2025-03-17 14:27:18,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.5) internal successors, (147), 14 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:18,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:18,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:18,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 14:27:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:27:18,699 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1028766038, now seen corresponding path program 2 times [2025-03-17 14:27:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430380182] [2025-03-17 14:27:18,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:18,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 14:27:18,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:18,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:18,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:18,832 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-17 14:27:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430380182] [2025-03-17 14:27:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430380182] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469502874] [2025-03-17 14:27:18,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:18,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:18,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:18,835 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:27:18,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-17 14:27:18,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:18,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:18,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:18,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:27:18,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:18,980 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-17 14:27:18,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:19,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:19,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 14 [2025-03-17 14:27:19,035 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-17 14:27:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469502874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:19,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 5] total 13 [2025-03-17 14:27:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485571809] [2025-03-17 14:27:19,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:19,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:27:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:19,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:27:19,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:19,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:19,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 629 flow. Second operand has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:19,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:19,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:19,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:19,238 INFO L124 PetriNetUnfolderBase]: 432/866 cut-off events. [2025-03-17 14:27:19,238 INFO L125 PetriNetUnfolderBase]: For 3109/3143 co-relation queries the response was YES. [2025-03-17 14:27:19,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3795 conditions, 866 events. 432/866 cut-off events. For 3109/3143 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4372 event pairs, 109 based on Foata normal form. 6/870 useless extension candidates. Maximal degree in co-relation 3371. Up to 606 conditions per place. [2025-03-17 14:27:19,243 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 68 selfloop transitions, 25 changer transitions 11/113 dead transitions. [2025-03-17 14:27:19,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 113 transitions, 1095 flow [2025-03-17 14:27:19,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:27:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:27:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2025-03-17 14:27:19,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4208754208754209 [2025-03-17 14:27:19,244 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 629 flow. Second operand 9 states and 125 transitions. [2025-03-17 14:27:19,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 113 transitions, 1095 flow [2025-03-17 14:27:19,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 113 transitions, 1070 flow, removed 10 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:19,251 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 804 flow [2025-03-17 14:27:19,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=804, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2025-03-17 14:27:19,252 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 61 predicate places. [2025-03-17 14:27:19,252 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 804 flow [2025-03-17 14:27:19,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.857142857142858) internal successors, (152), 14 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:19,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:19,253 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:19,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:27:19,453 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:19,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:19,454 INFO L85 PathProgramCache]: Analyzing trace with hash 129188558, now seen corresponding path program 3 times [2025-03-17 14:27:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295804125] [2025-03-17 14:27:19,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:19,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-17 14:27:19,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 22 statements. [2025-03-17 14:27:19,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:19,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:19,538 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-17 14:27:19,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:19,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295804125] [2025-03-17 14:27:19,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295804125] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:19,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822924225] [2025-03-17 14:27:19,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:19,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:19,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:19,541 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:19,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:27:19,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-03-17 14:27:19,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 22 statements. [2025-03-17 14:27:19,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:19,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 14:27:19,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:19,680 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-17 14:27:19,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:19,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:19,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 14 [2025-03-17 14:27:19,732 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-17 14:27:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822924225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:19,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:19,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 5] total 13 [2025-03-17 14:27:19,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139330284] [2025-03-17 14:27:19,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:19,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:27:19,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:19,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:27:19,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:19,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:19,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 804 flow. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:19,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:19,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:19,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:19,985 INFO L124 PetriNetUnfolderBase]: 464/931 cut-off events. [2025-03-17 14:27:19,985 INFO L125 PetriNetUnfolderBase]: For 4393/4433 co-relation queries the response was YES. [2025-03-17 14:27:19,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 931 events. 464/931 cut-off events. For 4393/4433 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4860 event pairs, 109 based on Foata normal form. 4/932 useless extension candidates. Maximal degree in co-relation 3925. Up to 664 conditions per place. [2025-03-17 14:27:19,992 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 77 selfloop transitions, 23 changer transitions 12/121 dead transitions. [2025-03-17 14:27:19,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 1289 flow [2025-03-17 14:27:19,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:27:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:27:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2025-03-17 14:27:19,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-17 14:27:19,994 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 804 flow. Second operand 8 states and 116 transitions. [2025-03-17 14:27:19,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 1289 flow [2025-03-17 14:27:20,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 121 transitions, 1264 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:20,004 INFO L231 Difference]: Finished difference. Result has 104 places, 94 transitions, 941 flow [2025-03-17 14:27:20,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=941, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2025-03-17 14:27:20,005 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 70 predicate places. [2025-03-17 14:27:20,005 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 941 flow [2025-03-17 14:27:20,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:20,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:20,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:20,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:20,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:27:20,206 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:20,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -96753012, now seen corresponding path program 4 times [2025-03-17 14:27:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517111535] [2025-03-17 14:27:20,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:20,213 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-17 14:27:20,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:20,220 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:27:20,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:20,427 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-17 14:27:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517111535] [2025-03-17 14:27:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517111535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616865642] [2025-03-17 14:27:20,428 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:20,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:20,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:20,430 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:20,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:27:20,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-17 14:27:20,488 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:20,488 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:27:20,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:20,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:27:20,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:20,541 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-17 14:27:20,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:20,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:20,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 14 [2025-03-17 14:27:20,588 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-17 14:27:20,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616865642] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:20,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:20,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2025-03-17 14:27:20,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415098781] [2025-03-17 14:27:20,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:20,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 14:27:20,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:20,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 14:27:20,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:20,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:20,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 941 flow. Second operand has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:20,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:20,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:20,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:20,863 INFO L124 PetriNetUnfolderBase]: 492/980 cut-off events. [2025-03-17 14:27:20,863 INFO L125 PetriNetUnfolderBase]: For 6082/6126 co-relation queries the response was YES. [2025-03-17 14:27:20,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4925 conditions, 980 events. 492/980 cut-off events. For 6082/6126 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5202 event pairs, 126 based on Foata normal form. 2/980 useless extension candidates. Maximal degree in co-relation 4464. Up to 716 conditions per place. [2025-03-17 14:27:20,870 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 83 selfloop transitions, 18 changer transitions 8/118 dead transitions. [2025-03-17 14:27:20,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 118 transitions, 1359 flow [2025-03-17 14:27:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:27:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 14:27:20,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2025-03-17 14:27:20,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2025-03-17 14:27:20,872 INFO L175 Difference]: Start difference. First operand has 104 places, 94 transitions, 941 flow. Second operand 8 states and 111 transitions. [2025-03-17 14:27:20,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 118 transitions, 1359 flow [2025-03-17 14:27:20,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 118 transitions, 1322 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-03-17 14:27:20,884 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 987 flow [2025-03-17 14:27:20,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=987, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2025-03-17 14:27:20,885 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 77 predicate places. [2025-03-17 14:27:20,885 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 987 flow [2025-03-17 14:27:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.571428571428571) internal successors, (148), 14 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:20,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:20,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:20,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:21,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:21,087 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:21,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:21,087 INFO L85 PathProgramCache]: Analyzing trace with hash -226821712, now seen corresponding path program 5 times [2025-03-17 14:27:21,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:21,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292656987] [2025-03-17 14:27:21,087 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:27:21,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:21,092 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-17 14:27:21,100 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:21,101 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:27:21,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:21,363 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-17 14:27:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292656987] [2025-03-17 14:27:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292656987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108749676] [2025-03-17 14:27:21,364 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:27:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:21,366 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:21,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:27:21,405 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-17 14:27:21,420 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:27:21,420 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:27:21,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:21,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 14:27:21,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:21,476 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-17 14:27:21,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:21,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:21,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 14 [2025-03-17 14:27:21,520 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-17 14:27:21,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108749676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:21,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:21,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 14 [2025-03-17 14:27:21,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753081279] [2025-03-17 14:27:21,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:21,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 14:27:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:21,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 14:27:21,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-17 14:27:21,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:21,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 987 flow. Second operand has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:21,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:21,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:21,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:21,929 INFO L124 PetriNetUnfolderBase]: 475/950 cut-off events. [2025-03-17 14:27:21,930 INFO L125 PetriNetUnfolderBase]: For 5829/5877 co-relation queries the response was YES. [2025-03-17 14:27:21,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4846 conditions, 950 events. 475/950 cut-off events. For 5829/5877 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4946 event pairs, 91 based on Foata normal form. 2/952 useless extension candidates. Maximal degree in co-relation 4355. Up to 551 conditions per place. [2025-03-17 14:27:21,938 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 74 selfloop transitions, 47 changer transitions 19/147 dead transitions. [2025-03-17 14:27:21,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 1699 flow [2025-03-17 14:27:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:27:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-17 14:27:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 163 transitions. [2025-03-17 14:27:21,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4116161616161616 [2025-03-17 14:27:21,945 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 987 flow. Second operand 12 states and 163 transitions. [2025-03-17 14:27:21,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 1699 flow [2025-03-17 14:27:21,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 147 transitions, 1645 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-17 14:27:21,957 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 1222 flow [2025-03-17 14:27:21,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1222, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2025-03-17 14:27:21,958 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 84 predicate places. [2025-03-17 14:27:21,958 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 1222 flow [2025-03-17 14:27:21,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.4) internal successors, (156), 15 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:21,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:21,960 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:21,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:22,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:22,160 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 857386337, now seen corresponding path program 6 times [2025-03-17 14:27:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704442445] [2025-03-17 14:27:22,161 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:27:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:22,166 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-03-17 14:27:22,173 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 27 statements. [2025-03-17 14:27:22,174 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:27:22,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:27:22,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:22,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704442445] [2025-03-17 14:27:22,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704442445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:22,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909422362] [2025-03-17 14:27:22,306 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:27:22,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:22,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:22,308 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:22,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 14:27:22,347 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-03-17 14:27:22,370 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 27 statements. [2025-03-17 14:27:22,371 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:27:22,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:22,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:27:22,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:22,402 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-17 14:27:22,455 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 18 treesize of output 12 [2025-03-17 14:27:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:27:22,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:27:22,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909422362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:22,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:22,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2025-03-17 14:27:22,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674962629] [2025-03-17 14:27:22,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:22,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:27:22,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:22,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:27:22,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:27:22,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:22,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 1222 flow. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:22,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:22,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:22,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:22,890 INFO L124 PetriNetUnfolderBase]: 514/913 cut-off events. [2025-03-17 14:27:22,890 INFO L125 PetriNetUnfolderBase]: For 6584/6614 co-relation queries the response was YES. [2025-03-17 14:27:22,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5010 conditions, 913 events. 514/913 cut-off events. For 6584/6614 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4281 event pairs, 82 based on Foata normal form. 57/969 useless extension candidates. Maximal degree in co-relation 4949. Up to 362 conditions per place. [2025-03-17 14:27:22,897 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 111 selfloop transitions, 22 changer transitions 0/137 dead transitions. [2025-03-17 14:27:22,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 137 transitions, 1746 flow [2025-03-17 14:27:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:27:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:27:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-03-17 14:27:22,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3468013468013468 [2025-03-17 14:27:22,901 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 1222 flow. Second operand 9 states and 103 transitions. [2025-03-17 14:27:22,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 137 transitions, 1746 flow [2025-03-17 14:27:22,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 137 transitions, 1574 flow, removed 55 selfloop flow, removed 12 redundant places. [2025-03-17 14:27:22,914 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 1119 flow [2025-03-17 14:27:22,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1119, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2025-03-17 14:27:22,915 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2025-03-17 14:27:22,915 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 1119 flow [2025-03-17 14:27:22,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:22,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:22,915 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:22,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 14:27:23,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:23,116 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:23,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:23,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1844000010, now seen corresponding path program 7 times [2025-03-17 14:27:23,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:23,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365326776] [2025-03-17 14:27:23,116 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:27:23,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:23,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:27:23,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:27:23,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:23,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:27:23,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365326776] [2025-03-17 14:27:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365326776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:23,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048985175] [2025-03-17 14:27:23,180 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:27:23,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:23,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:23,182 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:23,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 14:27:23,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:27:23,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:27:23,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:23,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:23,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:27:23,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:23,297 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:27:23,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 14:27:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048985175] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:23,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 14:27:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-03-17 14:27:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98927650] [2025-03-17 14:27:23,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:27:23,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 14:27:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:23,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 14:27:23,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-17 14:27:23,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:23,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 1119 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:23,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:23,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:23,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:23,477 INFO L124 PetriNetUnfolderBase]: 419/786 cut-off events. [2025-03-17 14:27:23,477 INFO L125 PetriNetUnfolderBase]: For 4550/4553 co-relation queries the response was YES. [2025-03-17 14:27:23,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4085 conditions, 786 events. 419/786 cut-off events. For 4550/4553 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3557 event pairs, 91 based on Foata normal form. 42/827 useless extension candidates. Maximal degree in co-relation 4030. Up to 348 conditions per place. [2025-03-17 14:27:23,484 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 98 selfloop transitions, 22 changer transitions 0/124 dead transitions. [2025-03-17 14:27:23,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 124 transitions, 1493 flow [2025-03-17 14:27:23,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:27:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 14:27:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2025-03-17 14:27:23,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-17 14:27:23,485 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 1119 flow. Second operand 7 states and 91 transitions. [2025-03-17 14:27:23,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 124 transitions, 1493 flow [2025-03-17 14:27:23,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 1433 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-03-17 14:27:23,493 INFO L231 Difference]: Finished difference. Result has 104 places, 106 transitions, 1112 flow [2025-03-17 14:27:23,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1068, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1112, PETRI_PLACES=104, PETRI_TRANSITIONS=106} [2025-03-17 14:27:23,494 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 70 predicate places. [2025-03-17 14:27:23,495 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 106 transitions, 1112 flow [2025-03-17 14:27:23,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:23,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:23,495 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:23,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:23,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 14:27:23,699 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:23,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1692689686, now seen corresponding path program 8 times [2025-03-17 14:27:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:23,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319815949] [2025-03-17 14:27:23,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:23,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:23,704 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:23,715 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:23,715 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:23,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:24,041 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319815949] [2025-03-17 14:27:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319815949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852291131] [2025-03-17 14:27:24,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:24,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:24,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:24,043 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:24,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 14:27:24,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:24,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:24,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:24,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:24,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 14:27:24,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:24,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 14:27:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:24,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:24,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852291131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:24,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:24,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 12] total 37 [2025-03-17 14:27:24,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551748015] [2025-03-17 14:27:24,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:24,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 14:27:24,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:24,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 14:27:24,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 14:27:24,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:24,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 106 transitions, 1112 flow. Second operand has 38 states, 38 states have (on average 7.7894736842105265) internal successors, (296), 38 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:24,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:24,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:24,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:27,101 INFO L124 PetriNetUnfolderBase]: 1220/2050 cut-off events. [2025-03-17 14:27:27,101 INFO L125 PetriNetUnfolderBase]: For 10222/10222 co-relation queries the response was YES. [2025-03-17 14:27:27,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10207 conditions, 2050 events. 1220/2050 cut-off events. For 10222/10222 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9882 event pairs, 52 based on Foata normal form. 2/2052 useless extension candidates. Maximal degree in co-relation 10152. Up to 899 conditions per place. [2025-03-17 14:27:27,111 INFO L140 encePairwiseOnDemand]: 18/33 looper letters, 159 selfloop transitions, 328 changer transitions 4/492 dead transitions. [2025-03-17 14:27:27,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 492 transitions, 4948 flow [2025-03-17 14:27:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-17 14:27:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-03-17 14:27:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 768 transitions. [2025-03-17 14:27:27,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.31880448318804483 [2025-03-17 14:27:27,114 INFO L175 Difference]: Start difference. First operand has 104 places, 106 transitions, 1112 flow. Second operand 73 states and 768 transitions. [2025-03-17 14:27:27,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 492 transitions, 4948 flow [2025-03-17 14:27:27,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 492 transitions, 4808 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-17 14:27:27,133 INFO L231 Difference]: Finished difference. Result has 175 places, 397 transitions, 4430 flow [2025-03-17 14:27:27,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=73, PETRI_FLOW=4430, PETRI_PLACES=175, PETRI_TRANSITIONS=397} [2025-03-17 14:27:27,133 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 141 predicate places. [2025-03-17 14:27:27,133 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 397 transitions, 4430 flow [2025-03-17 14:27:27,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.7894736842105265) internal successors, (296), 38 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:27,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:27,134 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:27,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 14:27:27,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:27,338 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:27,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:27,338 INFO L85 PathProgramCache]: Analyzing trace with hash 997021186, now seen corresponding path program 9 times [2025-03-17 14:27:27,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:27,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032676600] [2025-03-17 14:27:27,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:27,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:27,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:27,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 30 statements. [2025-03-17 14:27:27,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 14:27:27,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:27:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032676600] [2025-03-17 14:27:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032676600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023300094] [2025-03-17 14:27:27,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:27,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:27,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:27,772 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:27,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 14:27:27,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:27,836 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 30 statements. [2025-03-17 14:27:27,837 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 14:27:27,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:27,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 14:27:27,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:28,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:28,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:28,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-17 14:27:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023300094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:28,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 29 [2025-03-17 14:27:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9046624] [2025-03-17 14:27:28,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 14:27:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:28,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 14:27:28,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-17 14:27:28,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:28,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 397 transitions, 4430 flow. Second operand has 30 states, 30 states have (on average 8.2) internal successors, (246), 30 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:28,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:28,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:28,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:29,522 INFO L124 PetriNetUnfolderBase]: 1437/2436 cut-off events. [2025-03-17 14:27:29,522 INFO L125 PetriNetUnfolderBase]: For 11275/11275 co-relation queries the response was YES. [2025-03-17 14:27:29,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13926 conditions, 2436 events. 1437/2436 cut-off events. For 11275/11275 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12445 event pairs, 66 based on Foata normal form. 1/2437 useless extension candidates. Maximal degree in co-relation 13868. Up to 1555 conditions per place. [2025-03-17 14:27:29,533 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 361 selfloop transitions, 164 changer transitions 44/570 dead transitions. [2025-03-17 14:27:29,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 570 transitions, 7000 flow [2025-03-17 14:27:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 14:27:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-17 14:27:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 349 transitions. [2025-03-17 14:27:29,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3525252525252525 [2025-03-17 14:27:29,535 INFO L175 Difference]: Start difference. First operand has 175 places, 397 transitions, 4430 flow. Second operand 30 states and 349 transitions. [2025-03-17 14:27:29,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 570 transitions, 7000 flow [2025-03-17 14:27:29,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 570 transitions, 6526 flow, removed 209 selfloop flow, removed 9 redundant places. [2025-03-17 14:27:29,576 INFO L231 Difference]: Finished difference. Result has 207 places, 447 transitions, 5147 flow [2025-03-17 14:27:29,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4022, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5147, PETRI_PLACES=207, PETRI_TRANSITIONS=447} [2025-03-17 14:27:29,577 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 173 predicate places. [2025-03-17 14:27:29,577 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 447 transitions, 5147 flow [2025-03-17 14:27:29,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.2) internal successors, (246), 30 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:29,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:29,577 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:29,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:29,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:29,781 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:29,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1502468930, now seen corresponding path program 10 times [2025-03-17 14:27:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:29,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971016602] [2025-03-17 14:27:29,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:29,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:29,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:29,794 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:29,794 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:27:29,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:30,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971016602] [2025-03-17 14:27:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971016602] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:30,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955598061] [2025-03-17 14:27:30,159 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:30,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:30,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:30,161 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:30,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-17 14:27:30,209 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:30,230 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:30,230 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:27:30,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:30,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 14:27:30,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:30,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:30,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:30,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-17 14:27:30,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955598061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:30,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:30,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 27 [2025-03-17 14:27:30,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529927387] [2025-03-17 14:27:30,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:30,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 14:27:30,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:30,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 14:27:30,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-03-17 14:27:30,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:30,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 447 transitions, 5147 flow. Second operand has 28 states, 28 states have (on average 10.035714285714286) internal successors, (281), 28 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:30,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:30,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:30,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:31,562 INFO L124 PetriNetUnfolderBase]: 1326/2388 cut-off events. [2025-03-17 14:27:31,562 INFO L125 PetriNetUnfolderBase]: For 17457/17464 co-relation queries the response was YES. [2025-03-17 14:27:31,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14622 conditions, 2388 events. 1326/2388 cut-off events. For 17457/17464 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13322 event pairs, 71 based on Foata normal form. 6/2380 useless extension candidates. Maximal degree in co-relation 14553. Up to 1532 conditions per place. [2025-03-17 14:27:31,574 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 344 selfloop transitions, 98 changer transitions 1/525 dead transitions. [2025-03-17 14:27:31,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 525 transitions, 6800 flow [2025-03-17 14:27:31,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 14:27:31,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 14:27:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 202 transitions. [2025-03-17 14:27:31,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4080808080808081 [2025-03-17 14:27:31,575 INFO L175 Difference]: Start difference. First operand has 207 places, 447 transitions, 5147 flow. Second operand 15 states and 202 transitions. [2025-03-17 14:27:31,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 525 transitions, 6800 flow [2025-03-17 14:27:31,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 525 transitions, 6521 flow, removed 85 selfloop flow, removed 18 redundant places. [2025-03-17 14:27:31,628 INFO L231 Difference]: Finished difference. Result has 197 places, 483 transitions, 5669 flow [2025-03-17 14:27:31,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=4906, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5669, PETRI_PLACES=197, PETRI_TRANSITIONS=483} [2025-03-17 14:27:31,628 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 163 predicate places. [2025-03-17 14:27:31,628 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 483 transitions, 5669 flow [2025-03-17 14:27:31,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.035714285714286) internal successors, (281), 28 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:31,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:31,629 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:31,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:31,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:31,829 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:31,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash 25881462, now seen corresponding path program 11 times [2025-03-17 14:27:31,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:31,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86897375] [2025-03-17 14:27:31,830 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:27:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:31,834 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:31,841 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:31,841 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 14:27:31,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:32,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86897375] [2025-03-17 14:27:32,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86897375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:32,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440695751] [2025-03-17 14:27:32,196 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:27:32,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:32,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:32,198 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:32,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-17 14:27:32,236 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:32,251 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:32,251 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 14:27:32,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:32,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 14:27:32,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:32,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:32,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:32,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-17 14:27:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:32,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440695751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:32,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:32,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 20 [2025-03-17 14:27:32,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513672039] [2025-03-17 14:27:32,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 14:27:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:32,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 14:27:32,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-03-17 14:27:32,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:27:32,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 483 transitions, 5669 flow. Second operand has 21 states, 21 states have (on average 10.047619047619047) internal successors, (211), 21 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:32,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:32,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:27:32,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:33,112 INFO L124 PetriNetUnfolderBase]: 1426/2573 cut-off events. [2025-03-17 14:27:33,112 INFO L125 PetriNetUnfolderBase]: For 19541/19548 co-relation queries the response was YES. [2025-03-17 14:27:33,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15845 conditions, 2573 events. 1426/2573 cut-off events. For 19541/19548 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14653 event pairs, 57 based on Foata normal form. 8/2579 useless extension candidates. Maximal degree in co-relation 15782. Up to 1718 conditions per place. [2025-03-17 14:27:33,128 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 372 selfloop transitions, 84 changer transitions 1/539 dead transitions. [2025-03-17 14:27:33,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 539 transitions, 7102 flow [2025-03-17 14:27:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 14:27:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-17 14:27:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 221 transitions. [2025-03-17 14:27:33,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2025-03-17 14:27:33,129 INFO L175 Difference]: Start difference. First operand has 197 places, 483 transitions, 5669 flow. Second operand 17 states and 221 transitions. [2025-03-17 14:27:33,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 539 transitions, 7102 flow [2025-03-17 14:27:33,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 539 transitions, 6946 flow, removed 48 selfloop flow, removed 7 redundant places. [2025-03-17 14:27:33,185 INFO L231 Difference]: Finished difference. Result has 209 places, 501 transitions, 6037 flow [2025-03-17 14:27:33,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5513, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=483, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6037, PETRI_PLACES=209, PETRI_TRANSITIONS=501} [2025-03-17 14:27:33,186 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 175 predicate places. [2025-03-17 14:27:33,186 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 501 transitions, 6037 flow [2025-03-17 14:27:33,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 10.047619047619047) internal successors, (211), 21 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:33,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:33,186 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:33,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:33,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 14:27:33,387 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:33,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:33,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1785606398, now seen corresponding path program 12 times [2025-03-17 14:27:33,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100581617] [2025-03-17 14:27:33,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:27:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:33,391 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:33,397 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-17 14:27:33,397 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:27:33,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:33,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100581617] [2025-03-17 14:27:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100581617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822039305] [2025-03-17 14:27:33,664 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:27:33,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:33,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:33,666 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:33,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-17 14:27:33,708 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:33,724 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-17 14:27:33,725 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:27:33,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:33,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 14:27:33,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:33,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:27:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:33,840 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:33,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822039305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:33,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:33,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 29 [2025-03-17 14:27:33,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608562491] [2025-03-17 14:27:33,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:33,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 14:27:33,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:33,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 14:27:33,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-03-17 14:27:33,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:33,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 501 transitions, 6037 flow. Second operand has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:33,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:33,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:33,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:35,551 INFO L124 PetriNetUnfolderBase]: 2181/3678 cut-off events. [2025-03-17 14:27:35,551 INFO L125 PetriNetUnfolderBase]: For 23926/23926 co-relation queries the response was YES. [2025-03-17 14:27:35,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22778 conditions, 3678 events. 2181/3678 cut-off events. For 23926/23926 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20479 event pairs, 104 based on Foata normal form. 1/3679 useless extension candidates. Maximal degree in co-relation 22711. Up to 1931 conditions per place. [2025-03-17 14:27:35,570 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 262 selfloop transitions, 566 changer transitions 2/831 dead transitions. [2025-03-17 14:27:35,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 831 transitions, 11216 flow [2025-03-17 14:27:35,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 14:27:35,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-17 14:27:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 506 transitions. [2025-03-17 14:27:35,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-03-17 14:27:35,572 INFO L175 Difference]: Start difference. First operand has 209 places, 501 transitions, 6037 flow. Second operand 46 states and 506 transitions. [2025-03-17 14:27:35,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 831 transitions, 11216 flow [2025-03-17 14:27:35,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 831 transitions, 10994 flow, removed 74 selfloop flow, removed 8 redundant places. [2025-03-17 14:27:35,640 INFO L231 Difference]: Finished difference. Result has 255 places, 751 transitions, 11168 flow [2025-03-17 14:27:35,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5886, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=11168, PETRI_PLACES=255, PETRI_TRANSITIONS=751} [2025-03-17 14:27:35,641 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 221 predicate places. [2025-03-17 14:27:35,641 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 751 transitions, 11168 flow [2025-03-17 14:27:35,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:35,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:35,641 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:35,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:35,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 14:27:35,842 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:35,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash 459856958, now seen corresponding path program 13 times [2025-03-17 14:27:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40130249] [2025-03-17 14:27:35,842 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:27:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:35,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:27:35,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:35,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:35,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40130249] [2025-03-17 14:27:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40130249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920280862] [2025-03-17 14:27:36,322 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:27:36,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:36,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:36,324 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:36,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-17 14:27:36,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 14:27:36,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:36,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:27:36,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:36,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 14:27:36,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:36,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:36,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:36,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-17 14:27:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920280862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:36,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-03-17 14:27:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380863208] [2025-03-17 14:27:36,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:36,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 14:27:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:36,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 14:27:36,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-17 14:27:36,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-03-17 14:27:36,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 751 transitions, 11168 flow. Second operand has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 30 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:36,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:36,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-03-17 14:27:36,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:38,030 INFO L124 PetriNetUnfolderBase]: 2164/3758 cut-off events. [2025-03-17 14:27:38,030 INFO L125 PetriNetUnfolderBase]: For 35228/35228 co-relation queries the response was YES. [2025-03-17 14:27:38,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27895 conditions, 3758 events. 2164/3758 cut-off events. For 35228/35228 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 21936 event pairs, 90 based on Foata normal form. 1/3759 useless extension candidates. Maximal degree in co-relation 27818. Up to 2899 conditions per place. [2025-03-17 14:27:38,055 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 613 selfloop transitions, 169 changer transitions 1/845 dead transitions. [2025-03-17 14:27:38,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 845 transitions, 13888 flow [2025-03-17 14:27:38,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 14:27:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-17 14:27:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 292 transitions. [2025-03-17 14:27:38,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35393939393939394 [2025-03-17 14:27:38,056 INFO L175 Difference]: Start difference. First operand has 255 places, 751 transitions, 11168 flow. Second operand 25 states and 292 transitions. [2025-03-17 14:27:38,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 845 transitions, 13888 flow [2025-03-17 14:27:38,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 845 transitions, 13305 flow, removed 223 selfloop flow, removed 12 redundant places. [2025-03-17 14:27:38,229 INFO L231 Difference]: Finished difference. Result has 271 places, 784 transitions, 11738 flow [2025-03-17 14:27:38,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=10616, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=11738, PETRI_PLACES=271, PETRI_TRANSITIONS=784} [2025-03-17 14:27:38,229 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 237 predicate places. [2025-03-17 14:27:38,230 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 784 transitions, 11738 flow [2025-03-17 14:27:38,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 30 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:38,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:38,230 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:38,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-17 14:27:38,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 14:27:38,430 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:38,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1691539906, now seen corresponding path program 14 times [2025-03-17 14:27:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334027004] [2025-03-17 14:27:38,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:38,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:38,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:38,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334027004] [2025-03-17 14:27:38,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334027004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:38,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463424609] [2025-03-17 14:27:38,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:27:38,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:38,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:38,801 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:38,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-17 14:27:38,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:38,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:38,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:27:38,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:38,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 14:27:38,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:38,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:27:39,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:39,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 14 [2025-03-17 14:27:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:39,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:39,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-03-17 14:27:39,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:39,912 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 72 treesize of output 56 [2025-03-17 14:27:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:27:40,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463424609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:40,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:40,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 47 [2025-03-17 14:27:40,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963638150] [2025-03-17 14:27:40,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:40,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:27:40,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:40,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:27:40,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1888, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:27:40,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:40,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 784 transitions, 11738 flow. Second operand has 48 states, 48 states have (on average 7.666666666666667) internal successors, (368), 48 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:40,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:40,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:40,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:45,417 INFO L124 PetriNetUnfolderBase]: 4256/7122 cut-off events. [2025-03-17 14:27:45,417 INFO L125 PetriNetUnfolderBase]: For 60123/60123 co-relation queries the response was YES. [2025-03-17 14:27:45,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52199 conditions, 7122 events. 4256/7122 cut-off events. For 60123/60123 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 45266 event pairs, 78 based on Foata normal form. 1/7123 useless extension candidates. Maximal degree in co-relation 48989. Up to 2967 conditions per place. [2025-03-17 14:27:45,465 INFO L140 encePairwiseOnDemand]: 17/33 looper letters, 560 selfloop transitions, 1231 changer transitions 3/1795 dead transitions. [2025-03-17 14:27:45,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1795 transitions, 29305 flow [2025-03-17 14:27:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-17 14:27:45,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2025-03-17 14:27:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 1057 transitions. [2025-03-17 14:27:45,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3371610845295056 [2025-03-17 14:27:45,467 INFO L175 Difference]: Start difference. First operand has 271 places, 784 transitions, 11738 flow. Second operand 95 states and 1057 transitions. [2025-03-17 14:27:45,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 1795 transitions, 29305 flow [2025-03-17 14:27:45,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1795 transitions, 28640 flow, removed 188 selfloop flow, removed 16 redundant places. [2025-03-17 14:27:45,880 INFO L231 Difference]: Finished difference. Result has 378 places, 1574 transitions, 28423 flow [2025-03-17 14:27:45,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=11386, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=514, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=28423, PETRI_PLACES=378, PETRI_TRANSITIONS=1574} [2025-03-17 14:27:45,882 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 344 predicate places. [2025-03-17 14:27:45,882 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 1574 transitions, 28423 flow [2025-03-17 14:27:45,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 7.666666666666667) internal successors, (368), 48 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:45,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:45,883 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:45,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-17 14:27:46,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:46,084 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:46,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1274729970, now seen corresponding path program 15 times [2025-03-17 14:27:46,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:46,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114504912] [2025-03-17 14:27:46,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:46,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:46,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:46,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-17 14:27:46,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:46,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114504912] [2025-03-17 14:27:46,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114504912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087652965] [2025-03-17 14:27:46,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:27:46,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:46,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:46,311 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:46,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-17 14:27:46,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:27:46,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-17 14:27:46,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:27:46,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:46,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 14:27:46,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:46,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:46,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:46,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-17 14:27:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087652965] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:46,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 29 [2025-03-17 14:27:46,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509589230] [2025-03-17 14:27:46,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:46,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 14:27:46,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:46,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 14:27:46,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2025-03-17 14:27:46,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:46,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1574 transitions, 28423 flow. Second operand has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:46,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:46,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:46,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:49,701 INFO L124 PetriNetUnfolderBase]: 4670/7821 cut-off events. [2025-03-17 14:27:49,701 INFO L125 PetriNetUnfolderBase]: For 89643/89643 co-relation queries the response was YES. [2025-03-17 14:27:49,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66390 conditions, 7821 events. 4670/7821 cut-off events. For 89643/89643 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 50077 event pairs, 138 based on Foata normal form. 3/7824 useless extension candidates. Maximal degree in co-relation 64568. Up to 3934 conditions per place. [2025-03-17 14:27:49,770 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 566 selfloop transitions, 1381 changer transitions 7/1955 dead transitions. [2025-03-17 14:27:49,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 1955 transitions, 38597 flow [2025-03-17 14:27:49,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 14:27:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-17 14:27:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 538 transitions. [2025-03-17 14:27:49,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33964646464646464 [2025-03-17 14:27:49,772 INFO L175 Difference]: Start difference. First operand has 378 places, 1574 transitions, 28423 flow. Second operand 48 states and 538 transitions. [2025-03-17 14:27:49,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 1955 transitions, 38597 flow [2025-03-17 14:27:50,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 1955 transitions, 37102 flow, removed 664 selfloop flow, removed 12 redundant places. [2025-03-17 14:27:51,021 INFO L231 Difference]: Finished difference. Result has 431 places, 1845 transitions, 37833 flow [2025-03-17 14:27:51,021 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=27229, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=37833, PETRI_PLACES=431, PETRI_TRANSITIONS=1845} [2025-03-17 14:27:51,022 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 397 predicate places. [2025-03-17 14:27:51,022 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 1845 transitions, 37833 flow [2025-03-17 14:27:51,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.066666666666666) internal successors, (242), 30 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:51,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:27:51,022 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:27:51,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-17 14:27:51,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:51,223 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:27:51,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:27:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -782909022, now seen corresponding path program 16 times [2025-03-17 14:27:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:27:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044151415] [2025-03-17 14:27:51,223 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:27:51,227 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:51,232 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:51,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:27:51,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:27:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:27:51,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044151415] [2025-03-17 14:27:51,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044151415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:27:51,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114353531] [2025-03-17 14:27:51,589 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:27:51,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:27:51,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:27:51,590 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:27:51,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-17 14:27:51,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-17 14:27:51,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:27:51,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:27:51,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:27:51,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 14:27:51,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:27:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:51,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:27:51,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:27:51,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-17 14:27:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:27:51,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114353531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:27:51,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:27:51,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 32 [2025-03-17 14:27:51,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958382816] [2025-03-17 14:27:51,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:27:51,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 14:27:51,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:27:51,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 14:27:51,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 14:27:52,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:27:52,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 1845 transitions, 37833 flow. Second operand has 33 states, 33 states have (on average 8.151515151515152) internal successors, (269), 33 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:27:52,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:27:52,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:27:52,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:27:58,049 INFO L124 PetriNetUnfolderBase]: 6725/11092 cut-off events. [2025-03-17 14:27:58,049 INFO L125 PetriNetUnfolderBase]: For 162431/162431 co-relation queries the response was YES. [2025-03-17 14:27:58,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107241 conditions, 11092 events. 6725/11092 cut-off events. For 162431/162431 co-relation queries the response was YES. Maximal size of possible extension queue 520. Compared 73436 event pairs, 79 based on Foata normal form. 15/11107 useless extension candidates. Maximal degree in co-relation 107130. Up to 5020 conditions per place. [2025-03-17 14:27:58,283 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1211 selfloop transitions, 1515 changer transitions 7/2734 dead transitions. [2025-03-17 14:27:58,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 2734 transitions, 61385 flow [2025-03-17 14:27:58,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-17 14:27:58,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-17 14:27:58,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 727 transitions. [2025-03-17 14:27:58,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3496873496873497 [2025-03-17 14:27:58,285 INFO L175 Difference]: Start difference. First operand has 431 places, 1845 transitions, 37833 flow. Second operand 63 states and 727 transitions. [2025-03-17 14:27:58,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 492 places, 2734 transitions, 61385 flow [2025-03-17 14:28:01,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 2734 transitions, 60161 flow, removed 531 selfloop flow, removed 12 redundant places. [2025-03-17 14:28:01,452 INFO L231 Difference]: Finished difference. Result has 509 places, 2457 transitions, 56411 flow [2025-03-17 14:28:01,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=36941, PETRI_DIFFERENCE_MINUEND_PLACES=418, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1845, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=989, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=776, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=56411, PETRI_PLACES=509, PETRI_TRANSITIONS=2457} [2025-03-17 14:28:01,454 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 475 predicate places. [2025-03-17 14:28:01,454 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 2457 transitions, 56411 flow [2025-03-17 14:28:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 8.151515151515152) internal successors, (269), 33 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:28:01,454 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:01,454 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:28:01,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-17 14:28:01,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-17 14:28:01,655 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:28:01,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -999178552, now seen corresponding path program 17 times [2025-03-17 14:28:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:28:01,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154547101] [2025-03-17 14:28:01,656 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:28:01,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:28:01,660 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:28:01,669 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:28:01,669 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 14:28:01,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:28:01,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:28:01,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154547101] [2025-03-17 14:28:01,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154547101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:28:01,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605454322] [2025-03-17 14:28:01,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:28:01,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:01,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:01,936 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:28:01,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-17 14:28:01,974 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:28:01,989 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 14:28:01,989 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-17 14:28:01,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:01,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 14:28:01,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:28:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:28:02,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:28:02,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:28:02,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 43 [2025-03-17 14:28:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:28:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605454322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:28:02,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:28:02,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 29 [2025-03-17 14:28:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487483502] [2025-03-17 14:28:02,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:28:02,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 14:28:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:28:02,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 14:28:02,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-03-17 14:28:02,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2025-03-17 14:28:02,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 2457 transitions, 56411 flow. Second operand has 30 states, 30 states have (on average 10.033333333333333) internal successors, (301), 30 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:28:02,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:02,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2025-03-17 14:28:02,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:28:07,137 INFO L124 PetriNetUnfolderBase]: 6194/10767 cut-off events. [2025-03-17 14:28:07,138 INFO L125 PetriNetUnfolderBase]: For 237680/237757 co-relation queries the response was YES. [2025-03-17 14:28:07,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119648 conditions, 10767 events. 6194/10767 cut-off events. For 237680/237757 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 76539 event pairs, 129 based on Foata normal form. 76/10811 useless extension candidates. Maximal degree in co-relation 118887. Up to 7818 conditions per place. [2025-03-17 14:28:07,268 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 1862 selfloop transitions, 325 changer transitions 2/2629 dead transitions. [2025-03-17 14:28:07,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 530 places, 2629 transitions, 64643 flow [2025-03-17 14:28:07,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 14:28:07,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-17 14:28:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 288 transitions. [2025-03-17 14:28:07,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39669421487603307 [2025-03-17 14:28:07,269 INFO L175 Difference]: Start difference. First operand has 509 places, 2457 transitions, 56411 flow. Second operand 22 states and 288 transitions. [2025-03-17 14:28:07,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 530 places, 2629 transitions, 64643 flow [2025-03-17 14:28:12,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 2629 transitions, 62187 flow, removed 1142 selfloop flow, removed 10 redundant places. [2025-03-17 14:28:12,788 INFO L231 Difference]: Finished difference. Result has 531 places, 2569 transitions, 58268 flow [2025-03-17 14:28:12,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54077, PETRI_DIFFERENCE_MINUEND_PLACES=499, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=232, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=58268, PETRI_PLACES=531, PETRI_TRANSITIONS=2569} [2025-03-17 14:28:12,790 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 497 predicate places. [2025-03-17 14:28:12,790 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 2569 transitions, 58268 flow [2025-03-17 14:28:12,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 10.033333333333333) internal successors, (301), 30 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:28:12,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:28:12,790 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:28:12,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-17 14:28:12,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-17 14:28:12,991 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-03-17 14:28:12,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:28:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1447632814, now seen corresponding path program 18 times [2025-03-17 14:28:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:28:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831263377] [2025-03-17 14:28:12,991 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:28:12,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:28:12,995 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:28:13,000 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-17 14:28:13,000 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:28:13,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:28:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:28:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831263377] [2025-03-17 14:28:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831263377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:28:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118562729] [2025-03-17 14:28:13,200 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:28:13,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:28:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:28:13,202 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:28:13,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-17 14:28:13,245 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-03-17 14:28:13,262 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-03-17 14:28:13,262 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-17 14:28:13,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:28:13,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 14:28:13,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:28:13,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 14:28:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:28:13,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:28:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 14:28:13,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118562729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:28:13,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:28:13,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 34 [2025-03-17 14:28:13,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579314832] [2025-03-17 14:28:13,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:28:13,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 14:28:13,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:28:13,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 14:28:13,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 14:28:13,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-03-17 14:28:13,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 2569 transitions, 58268 flow. Second operand has 35 states, 35 states have (on average 7.685714285714286) internal successors, (269), 35 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:28:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:28:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-03-17 14:28:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:28:19,484 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-17 14:28:23,502 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-17 14:28:27,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:28:33,213 INFO L124 PetriNetUnfolderBase]: 7769/12826 cut-off events. [2025-03-17 14:28:33,213 INFO L125 PetriNetUnfolderBase]: For 234515/234515 co-relation queries the response was YES. [2025-03-17 14:28:33,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135450 conditions, 12826 events. 7769/12826 cut-off events. For 234515/234515 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 87387 event pairs, 105 based on Foata normal form. 1/12827 useless extension candidates. Maximal degree in co-relation 134687. Up to 7260 conditions per place. [2025-03-17 14:28:33,381 INFO L140 encePairwiseOnDemand]: 19/33 looper letters, 1026 selfloop transitions, 2026 changer transitions 4/3057 dead transitions. [2025-03-17 14:28:33,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 3057 transitions, 75194 flow [2025-03-17 14:28:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-17 14:28:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-03-17 14:28:33,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 588 transitions. [2025-03-17 14:28:33,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3239669421487603 [2025-03-17 14:28:33,383 INFO L175 Difference]: Start difference. First operand has 531 places, 2569 transitions, 58268 flow. Second operand 55 states and 588 transitions. [2025-03-17 14:28:33,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 3057 transitions, 75194 flow