./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-cond-3.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 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:17:56,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:17:56,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:17:56,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:17:56,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:17:56,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:17:56,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:17:56,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:17:56,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:17:56,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:17:56,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:17:56,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:17:56,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:17:56,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:17:56,117 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:56,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:17:56,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:17:56,117 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 -> 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 [2025-03-04 10:17:56,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:17:56,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:17:56,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:17:56,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:17:56,344 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:17:56,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-04 10:17:57,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d234da3/d207de04d89d42bcacc34ea8d60aa529/FLAG9e62a0cb9 [2025-03-04 10:17:57,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:17:57,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-04 10:17:57,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d234da3/d207de04d89d42bcacc34ea8d60aa529/FLAG9e62a0cb9 [2025-03-04 10:17:57,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45d234da3/d207de04d89d42bcacc34ea8d60aa529 [2025-03-04 10:17:57,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:17:57,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:17:57,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:57,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:17:57,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:17:57,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:57" (1/1) ... [2025-03-04 10:17:57,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72531e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:57, skipping insertion in model container [2025-03-04 10:17:57,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:17:57" (1/1) ... [2025-03-04 10:17:57,979 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:17:58,102 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:17:58,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:58,115 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:17:58,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:17:58,139 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:17:58,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58 WrapperNode [2025-03-04 10:17:58,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:17:58,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:58,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:17:58,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:17:58,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,162 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 148 [2025-03-04 10:17:58,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:17:58,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:17:58,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:17:58,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:17:58,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,170 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,184 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 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-04 10:17:58,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,189 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,190 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,190 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:17:58,194 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:17:58,194 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:17:58,194 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:17:58,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (1/1) ... [2025-03-04 10:17:58,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:17:58,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:58,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:17:58,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:17:58,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:17:58,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:17:58,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:17:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:17:58,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:17:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:17:58,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:17:58,234 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:17:58,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:17:58,299 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:17:58,548 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:17:58,549 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:17:58,697 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:17:58,698 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:17:58,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:58 BoogieIcfgContainer [2025-03-04 10:17:58,698 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:17:58,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:17:58,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:17:58,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:17:58,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:17:57" (1/3) ... [2025-03-04 10:17:58,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376b2f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:58, skipping insertion in model container [2025-03-04 10:17:58,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:17:58" (2/3) ... [2025-03-04 10:17:58,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@376b2f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:17:58, skipping insertion in model container [2025-03-04 10:17:58,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:17:58" (3/3) ... [2025-03-04 10:17:58,707 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-03-04 10:17:58,718 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:17:58,719 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 44 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-04 10:17:58,719 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:17:58,763 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:17:58,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 110 flow [2025-03-04 10:17:58,811 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-03-04 10:17:58,815 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:17:58,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 5/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-04 10:17:58,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 110 flow [2025-03-04 10:17:58,821 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 45 transitions, 102 flow [2025-03-04 10:17:58,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:17:58,838 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;@28fa354, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:17:58,838 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-04 10:17:58,842 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:17:58,842 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:17:58,843 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:17:58,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:58,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:17:58,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:17:58,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:58,848 INFO L85 PathProgramCache]: Analyzing trace with hash 442539, now seen corresponding path program 1 times [2025-03-04 10:17:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934236250] [2025-03-04 10:17:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:58,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:17:58,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:17:58,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:58,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:59,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:59,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934236250] [2025-03-04 10:17:59,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934236250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:59,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:59,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:17:59,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900882945] [2025-03-04 10:17:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:59,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:17:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:59,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:17:59,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:17:59,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-04 10:17:59,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:59,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:59,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-04 10:17:59,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:59,176 INFO L124 PetriNetUnfolderBase]: 147/328 cut-off events. [2025-03-04 10:17:59,176 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 10:17:59,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 328 events. 147/328 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1619 event pairs, 94 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 510. Up to 235 conditions per place. [2025-03-04 10:17:59,182 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-04 10:17:59,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 146 flow [2025-03-04 10:17:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-04 10:17:59,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 10:17:59,193 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 102 flow. Second operand 3 states and 87 transitions. [2025-03-04 10:17:59,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 146 flow [2025-03-04 10:17:59,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:17:59,198 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 92 flow [2025-03-04 10:17:59,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-03-04 10:17:59,201 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-03-04 10:17:59,201 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 92 flow [2025-03-04 10:17:59,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:59,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:59,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:17:59,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:17:59,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:17:59,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:59,202 INFO L85 PathProgramCache]: Analyzing trace with hash 442540, now seen corresponding path program 1 times [2025-03-04 10:17:59,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:59,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025987761] [2025-03-04 10:17:59,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:59,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:17:59,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:17:59,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:59,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:59,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025987761] [2025-03-04 10:17:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025987761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:17:59,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:17:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:17:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666647062] [2025-03-04 10:17:59,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:17:59,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:17:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:17:59,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:17:59,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:17:59,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-04 10:17:59,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:59,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:17:59,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-04 10:17:59,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:17:59,552 INFO L124 PetriNetUnfolderBase]: 148/331 cut-off events. [2025-03-04 10:17:59,552 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:17:59,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 331 events. 148/331 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1643 event pairs, 94 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 561. Up to 240 conditions per place. [2025-03-04 10:17:59,556 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 26 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-03-04 10:17:59,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 158 flow [2025-03-04 10:17:59,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:17:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:17:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-04 10:17:59,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 10:17:59,558 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 92 flow. Second operand 3 states and 90 transitions. [2025-03-04 10:17:59,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 158 flow [2025-03-04 10:17:59,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:17:59,560 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 107 flow [2025-03-04 10:17:59,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2025-03-04 10:17:59,560 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-03-04 10:17:59,561 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 107 flow [2025-03-04 10:17:59,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:17:59,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:17:59,561 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:17:59,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:17:59,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:17:59,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:17:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 425294874, now seen corresponding path program 1 times [2025-03-04 10:17:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:17:59,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-03-04 10:17:59,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:59,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:17:59,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:17:59,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:17:59,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:59,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:17:59,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:17:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162665499] [2025-03-04 10:17:59,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162665499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:17:59,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181813688] [2025-03-04 10:17:59,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:17:59,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:17:59,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:17:59,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:17:59,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:17:59,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:17:59,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:17:59,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:17:59,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:17:59,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:17:59,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:17:59,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:18:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:00,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181813688] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:00,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:00,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:18:00,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057101998] [2025-03-04 10:18:00,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:00,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:18:00,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:00,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:18:00,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:18:00,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-04 10:18:00,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 107 flow. Second operand has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:00,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:00,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-04 10:18:00,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:00,496 INFO L124 PetriNetUnfolderBase]: 148/330 cut-off events. [2025-03-04 10:18:00,496 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:18:00,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 330 events. 148/330 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1625 event pairs, 94 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 561. Up to 236 conditions per place. [2025-03-04 10:18:00,498 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 22 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2025-03-04 10:18:00,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 161 flow [2025-03-04 10:18:00,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:00,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:00,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-04 10:18:00,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-03-04 10:18:00,499 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 107 flow. Second operand 5 states and 129 transitions. [2025-03-04 10:18:00,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 161 flow [2025-03-04 10:18:00,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:00,500 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 120 flow [2025-03-04 10:18:00,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-03-04 10:18:00,501 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2025-03-04 10:18:00,501 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 120 flow [2025-03-04 10:18:00,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:00,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:00,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:18:00,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:18:00,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-04 10:18:00,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:00,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:00,706 INFO L85 PathProgramCache]: Analyzing trace with hash 301776473, now seen corresponding path program 1 times [2025-03-04 10:18:00,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:00,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282673360] [2025-03-04 10:18:00,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:00,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:00,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:18:00,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:18:00,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:00,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:00,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:00,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282673360] [2025-03-04 10:18:00,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282673360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:00,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:00,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:00,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607754417] [2025-03-04 10:18:00,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:00,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:00,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:00,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:00,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:00,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-03-04 10:18:00,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:00,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:00,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-03-04 10:18:00,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:00,819 INFO L124 PetriNetUnfolderBase]: 147/329 cut-off events. [2025-03-04 10:18:00,819 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:18:00,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 329 events. 147/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1622 event pairs, 94 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 561. Up to 238 conditions per place. [2025-03-04 10:18:00,821 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 25 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-04 10:18:00,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 168 flow [2025-03-04 10:18:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:00,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-04 10:18:00,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2025-03-04 10:18:00,822 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 120 flow. Second operand 3 states and 91 transitions. [2025-03-04 10:18:00,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 168 flow [2025-03-04 10:18:00,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 158 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:00,824 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 108 flow [2025-03-04 10:18:00,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-04 10:18:00,824 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-03-04 10:18:00,824 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 108 flow [2025-03-04 10:18:00,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:00,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:00,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:00,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:18:00,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash -190962646, now seen corresponding path program 1 times [2025-03-04 10:18:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367807599] [2025-03-04 10:18:00,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:00,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:18:00,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:18:00,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:00,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367807599] [2025-03-04 10:18:00,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367807599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:00,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:00,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:00,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747413649] [2025-03-04 10:18:00,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:00,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:00,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-04 10:18:00,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:00,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:00,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-04 10:18:00,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:00,949 INFO L124 PetriNetUnfolderBase]: 147/293 cut-off events. [2025-03-04 10:18:00,949 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:18:00,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 293 events. 147/293 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1229 event pairs, 94 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 535. Up to 234 conditions per place. [2025-03-04 10:18:00,952 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 25 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-04 10:18:00,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 150 flow [2025-03-04 10:18:00,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 10:18:00,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-03-04 10:18:00,953 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 108 flow. Second operand 4 states and 87 transitions. [2025-03-04 10:18:00,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 150 flow [2025-03-04 10:18:00,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:00,954 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 96 flow [2025-03-04 10:18:00,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-03-04 10:18:00,955 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2025-03-04 10:18:00,955 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 96 flow [2025-03-04 10:18:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:00,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:00,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:00,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:18:00,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:00,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -190962645, now seen corresponding path program 1 times [2025-03-04 10:18:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:00,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-04 10:18:00,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:00,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:18:00,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:18:00,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:00,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:01,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:01,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-04 10:18:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832597719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316018970] [2025-03-04 10:18:01,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:01,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:01,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:18:01,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:18:01,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:18:01,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:01,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:01,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:18:01,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:01,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:01,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:01,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:01,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316018970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:01,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:01,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-04 10:18:01,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972576939] [2025-03-04 10:18:01,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:01,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:18:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:01,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:18:01,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:18:01,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-04 10:18:01,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 96 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:01,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:01,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-04 10:18:01,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:01,602 INFO L124 PetriNetUnfolderBase]: 307/551 cut-off events. [2025-03-04 10:18:01,602 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:18:01,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 551 events. 307/551 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2590 event pairs, 100 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 1043. Up to 277 conditions per place. [2025-03-04 10:18:01,605 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 43 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-04 10:18:01,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 231 flow [2025-03-04 10:18:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:01,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-03-04 10:18:01,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-04 10:18:01,606 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 96 flow. Second operand 5 states and 148 transitions. [2025-03-04 10:18:01,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 231 flow [2025-03-04 10:18:01,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:01,607 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 109 flow [2025-03-04 10:18:01,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-04 10:18:01,608 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-03-04 10:18:01,608 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 109 flow [2025-03-04 10:18:01,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:01,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:01,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:01,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:01,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:18:01,809 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:01,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:01,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1139789621, now seen corresponding path program 1 times [2025-03-04 10:18:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:01,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052139373] [2025-03-04 10:18:01,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:01,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:01,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:01,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:01,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:01,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:01,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:01,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052139373] [2025-03-04 10:18:01,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052139373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:01,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605671552] [2025-03-04 10:18:01,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:01,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:01,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:01,980 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:01,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:18:02,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:02,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:02,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:02,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:02,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:18:02,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:02,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:18:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:02,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:02,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605671552] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:02,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:18:02,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2025-03-04 10:18:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580884028] [2025-03-04 10:18:02,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:02,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:02,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:02,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:18:02,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 10:18:02,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:02,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:02,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 10:18:02,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:02,332 INFO L124 PetriNetUnfolderBase]: 540/931 cut-off events. [2025-03-04 10:18:02,332 INFO L125 PetriNetUnfolderBase]: For 100/128 co-relation queries the response was YES. [2025-03-04 10:18:02,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 931 events. 540/931 cut-off events. For 100/128 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4360 event pairs, 123 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 1920. Up to 599 conditions per place. [2025-03-04 10:18:02,336 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 44 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-04 10:18:02,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 246 flow [2025-03-04 10:18:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-04 10:18:02,338 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-04 10:18:02,338 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 109 flow. Second operand 4 states and 112 transitions. [2025-03-04 10:18:02,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 246 flow [2025-03-04 10:18:02,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:02,340 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 135 flow [2025-03-04 10:18:02,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2025-03-04 10:18:02,341 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2025-03-04 10:18:02,341 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 135 flow [2025-03-04 10:18:02,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:02,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:02,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:02,347 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-04 10:18:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:02,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:02,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1168506990, now seen corresponding path program 1 times [2025-03-04 10:18:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:02,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699140878] [2025-03-04 10:18:02,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:02,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:02,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:02,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:02,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:02,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:02,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699140878] [2025-03-04 10:18:02,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699140878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:02,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878699227] [2025-03-04 10:18:02,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:02,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:02,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:02,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:02,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:18:02,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:18:02,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:18:02,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:02,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:02,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:02,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:02,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:02,872 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 36 treesize of output 32 [2025-03-04 10:18:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:02,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878699227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:02,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:02,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-04 10:18:02,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483949785] [2025-03-04 10:18:02,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:02,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:18:02,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:03,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:18:03,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:18:03,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-04 10:18:03,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 135 flow. Second operand has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:03,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:03,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-04 10:18:03,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:03,724 INFO L124 PetriNetUnfolderBase]: 890/1643 cut-off events. [2025-03-04 10:18:03,725 INFO L125 PetriNetUnfolderBase]: For 199/214 co-relation queries the response was YES. [2025-03-04 10:18:03,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3631 conditions, 1643 events. 890/1643 cut-off events. For 199/214 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9498 event pairs, 520 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 1951. Up to 741 conditions per place. [2025-03-04 10:18:03,735 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 88 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2025-03-04 10:18:03,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 106 transitions, 530 flow [2025-03-04 10:18:03,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2025-03-04 10:18:03,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6380208333333334 [2025-03-04 10:18:03,736 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 135 flow. Second operand 8 states and 245 transitions. [2025-03-04 10:18:03,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 106 transitions, 530 flow [2025-03-04 10:18:03,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 106 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:03,739 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 202 flow [2025-03-04 10:18:03,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2025-03-04 10:18:03,741 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2025-03-04 10:18:03,741 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 202 flow [2025-03-04 10:18:03,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:03,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:03,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:03,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:18:03,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:03,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:03,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash 973740374, now seen corresponding path program 1 times [2025-03-04 10:18:03,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:03,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-04 10:18:03,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:03,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:03,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:18:03,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:18:03,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:03,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-04 10:18:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216378467] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052652603] [2025-03-04 10:18:04,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:04,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:04,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:04,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:04,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:18:04,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:18:04,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:18:04,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:04,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:04,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:04,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:04,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:04,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-04 10:18:04,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052652603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:04,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:18:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940099394] [2025-03-04 10:18:04,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:18:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:04,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:18:04,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:18:04,507 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 10:18:04,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 202 flow. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:04,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:04,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 10:18:04,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:04,795 INFO L124 PetriNetUnfolderBase]: 1125/1925 cut-off events. [2025-03-04 10:18:04,795 INFO L125 PetriNetUnfolderBase]: For 1028/1084 co-relation queries the response was YES. [2025-03-04 10:18:04,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 1925 events. 1125/1925 cut-off events. For 1028/1084 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10381 event pairs, 540 based on Foata normal form. 0/1722 useless extension candidates. Maximal degree in co-relation 3946. Up to 1451 conditions per place. [2025-03-04 10:18:04,805 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 63 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2025-03-04 10:18:04,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 457 flow [2025-03-04 10:18:04,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:04,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-03-04 10:18:04,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 10:18:04,808 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 202 flow. Second operand 7 states and 176 transitions. [2025-03-04 10:18:04,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 457 flow [2025-03-04 10:18:04,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 449 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:04,812 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 250 flow [2025-03-04 10:18:04,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-04 10:18:04,814 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-04 10:18:04,814 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 250 flow [2025-03-04 10:18:04,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:04,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:04,814 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:04,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:18:05,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:05,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1969476288, now seen corresponding path program 2 times [2025-03-04 10:18:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-03-04 10:18:05,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:05,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:05,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:18:05,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:18:05,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:05,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:05,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:05,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:05,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110321968] [2025-03-04 10:18:05,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110321968] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:05,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169403709] [2025-03-04 10:18:05,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:05,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:05,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:05,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:05,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:18:05,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-04 10:18:05,181 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-04 10:18:05,181 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:05,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:05,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:18:05,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:05,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:18:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:05,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:18:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169403709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:05,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:05,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-04 10:18:05,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259168034] [2025-03-04 10:18:05,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:05,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:18:05,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:05,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:18:05,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:18:05,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-04 10:18:05,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:05,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:05,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-04 10:18:05,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:05,849 INFO L124 PetriNetUnfolderBase]: 879/1625 cut-off events. [2025-03-04 10:18:05,849 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2025-03-04 10:18:05,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1625 events. 879/1625 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9539 event pairs, 474 based on Foata normal form. 0/1579 useless extension candidates. Maximal degree in co-relation 3509. Up to 1036 conditions per place. [2025-03-04 10:18:05,857 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 52 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2025-03-04 10:18:05,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 446 flow [2025-03-04 10:18:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-04 10:18:05,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-03-04 10:18:05,859 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 250 flow. Second operand 5 states and 139 transitions. [2025-03-04 10:18:05,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 446 flow [2025-03-04 10:18:05,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 429 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:05,867 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 248 flow [2025-03-04 10:18:05,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-03-04 10:18:05,867 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2025-03-04 10:18:05,867 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 248 flow [2025-03-04 10:18:05,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:05,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:05,868 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:05,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:18:06,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:06,072 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:06,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:06,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1814460732, now seen corresponding path program 2 times [2025-03-04 10:18:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815177747] [2025-03-04 10:18:06,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:06,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:06,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:18:06,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-04 10:18:06,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:06,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:18:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815177747] [2025-03-04 10:18:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815177747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:06,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:06,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:18:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019922530] [2025-03-04 10:18:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:06,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:06,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:06,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:06,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:06,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 10:18:06,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:06,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 10:18:06,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:06,440 INFO L124 PetriNetUnfolderBase]: 1148/1952 cut-off events. [2025-03-04 10:18:06,440 INFO L125 PetriNetUnfolderBase]: For 1955/1955 co-relation queries the response was YES. [2025-03-04 10:18:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 1952 events. 1148/1952 cut-off events. For 1955/1955 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10360 event pairs, 246 based on Foata normal form. 16/1791 useless extension candidates. Maximal degree in co-relation 4463. Up to 1236 conditions per place. [2025-03-04 10:18:06,448 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 63 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2025-03-04 10:18:06,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 523 flow [2025-03-04 10:18:06,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:06,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-04 10:18:06,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-03-04 10:18:06,449 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 248 flow. Second operand 5 states and 133 transitions. [2025-03-04 10:18:06,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 523 flow [2025-03-04 10:18:06,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 481 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:06,454 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 259 flow [2025-03-04 10:18:06,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-04 10:18:06,455 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-04 10:18:06,455 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 259 flow [2025-03-04 10:18:06,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:06,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:06,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:06,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:18:06,455 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:06,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash -539371361, now seen corresponding path program 1 times [2025-03-04 10:18:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:06,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496539883] [2025-03-04 10:18:06,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:06,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:06,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:06,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:06,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:06,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:06,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496539883] [2025-03-04 10:18:06,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496539883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:06,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836830577] [2025-03-04 10:18:06,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:06,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:06,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:06,563 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:06,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:18:06,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:18:06,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:18:06,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:06,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:06,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:18:06,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:06,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:06,735 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 36 treesize of output 32 [2025-03-04 10:18:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:06,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836830577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:06,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:06,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-04 10:18:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971243680] [2025-03-04 10:18:06,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:06,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:18:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:06,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:18:06,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:18:07,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 10:18:07,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 259 flow. Second operand has 16 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:07,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:07,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 10:18:07,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:07,423 INFO L124 PetriNetUnfolderBase]: 1033/1757 cut-off events. [2025-03-04 10:18:07,424 INFO L125 PetriNetUnfolderBase]: For 1405/1405 co-relation queries the response was YES. [2025-03-04 10:18:07,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 1757 events. 1033/1757 cut-off events. For 1405/1405 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9182 event pairs, 561 based on Foata normal form. 16/1666 useless extension candidates. Maximal degree in co-relation 4005. Up to 892 conditions per place. [2025-03-04 10:18:07,432 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 74 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2025-03-04 10:18:07,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 579 flow [2025-03-04 10:18:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:18:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:18:07,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2025-03-04 10:18:07,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-03-04 10:18:07,435 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 259 flow. Second operand 8 states and 210 transitions. [2025-03-04 10:18:07,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 579 flow [2025-03-04 10:18:07,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 561 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:07,441 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 331 flow [2025-03-04 10:18:07,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-03-04 10:18:07,442 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-04 10:18:07,443 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 331 flow [2025-03-04 10:18:07,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:07,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:07,443 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:07,450 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-04 10:18:07,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:07,644 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:07,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -413707346, now seen corresponding path program 1 times [2025-03-04 10:18:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-03-04 10:18:07,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:07,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:18:07,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:18:07,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:07,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:18:07,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882485429] [2025-03-04 10:18:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882485429] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:07,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629081601] [2025-03-04 10:18:07,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:07,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:07,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:07,778 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:18:07,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:18:07,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:18:07,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:18:07,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:07,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:07,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:18:07,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:18:07,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:18:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629081601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:07,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:18:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 10:18:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25964650] [2025-03-04 10:18:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:07,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:07,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:07,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:07,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-04 10:18:07,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:07,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:07,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-04 10:18:07,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:08,073 INFO L124 PetriNetUnfolderBase]: 882/1514 cut-off events. [2025-03-04 10:18:08,073 INFO L125 PetriNetUnfolderBase]: For 1495/1495 co-relation queries the response was YES. [2025-03-04 10:18:08,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 1514 events. 882/1514 cut-off events. For 1495/1495 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7896 event pairs, 288 based on Foata normal form. 32/1497 useless extension candidates. Maximal degree in co-relation 3794. Up to 757 conditions per place. [2025-03-04 10:18:08,080 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 38 selfloop transitions, 20 changer transitions 0/62 dead transitions. [2025-03-04 10:18:08,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 460 flow [2025-03-04 10:18:08,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 10:18:08,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-04 10:18:08,082 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 331 flow. Second operand 5 states and 116 transitions. [2025-03-04 10:18:08,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 460 flow [2025-03-04 10:18:08,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 443 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 10:18:08,088 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 322 flow [2025-03-04 10:18:08,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-03-04 10:18:08,088 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-04 10:18:08,088 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 322 flow [2025-03-04 10:18:08,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:08,089 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-04 10:18:08,095 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-04 10:18:08,293 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,SelfDestructingSolverStorable12 [2025-03-04 10:18:08,293 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:08,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1188696194, now seen corresponding path program 1 times [2025-03-04 10:18:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057767753] [2025-03-04 10:18:08,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:08,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:08,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:18:08,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:18:08,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:08,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:08,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:08,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057767753] [2025-03-04 10:18:08,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057767753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:08,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:08,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:18:08,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319176392] [2025-03-04 10:18:08,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:08,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:18:08,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:08,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:18:08,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:18:08,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-03-04 10:18:08,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:08,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-03-04 10:18:08,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:08,458 INFO L124 PetriNetUnfolderBase]: 917/1556 cut-off events. [2025-03-04 10:18:08,458 INFO L125 PetriNetUnfolderBase]: For 1996/1996 co-relation queries the response was YES. [2025-03-04 10:18:08,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4808 conditions, 1556 events. 917/1556 cut-off events. For 1996/1996 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7929 event pairs, 233 based on Foata normal form. 2/1516 useless extension candidates. Maximal degree in co-relation 4153. Up to 1170 conditions per place. [2025-03-04 10:18:08,464 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 59 selfloop transitions, 9 changer transitions 1/73 dead transitions. [2025-03-04 10:18:08,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 573 flow [2025-03-04 10:18:08,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:18:08,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:18:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-04 10:18:08,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-03-04 10:18:08,465 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 322 flow. Second operand 3 states and 106 transitions. [2025-03-04 10:18:08,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 573 flow [2025-03-04 10:18:08,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 519 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:18:08,469 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 389 flow [2025-03-04 10:18:08,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-03-04 10:18:08,470 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2025-03-04 10:18:08,470 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 389 flow [2025-03-04 10:18:08,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:08,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:08,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:18:08,470 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:08,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1312800766, now seen corresponding path program 1 times [2025-03-04 10:18:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-03-04 10:18:08,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:08,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:18:08,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:08,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:08,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:08,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411652019] [2025-03-04 10:18:08,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411652019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:08,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967039731] [2025-03-04 10:18:08,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:08,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:08,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:08,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-03-04 10:18:08,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:08,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-03-04 10:18:08,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:08,745 INFO L124 PetriNetUnfolderBase]: 1038/1744 cut-off events. [2025-03-04 10:18:08,745 INFO L125 PetriNetUnfolderBase]: For 2043/2043 co-relation queries the response was YES. [2025-03-04 10:18:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5286 conditions, 1744 events. 1038/1744 cut-off events. For 2043/2043 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9239 event pairs, 373 based on Foata normal form. 18/1760 useless extension candidates. Maximal degree in co-relation 4556. Up to 964 conditions per place. [2025-03-04 10:18:08,758 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 115 selfloop transitions, 9 changer transitions 0/126 dead transitions. [2025-03-04 10:18:08,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 126 transitions, 1020 flow [2025-03-04 10:18:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-03-04 10:18:08,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791666666666667 [2025-03-04 10:18:08,760 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 389 flow. Second operand 5 states and 163 transitions. [2025-03-04 10:18:08,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 126 transitions, 1020 flow [2025-03-04 10:18:08,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 126 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:08,767 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 453 flow [2025-03-04 10:18:08,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-03-04 10:18:08,768 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2025-03-04 10:18:08,768 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 453 flow [2025-03-04 10:18:08,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:08,768 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:08,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:18:08,768 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:08,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:08,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1379976300, now seen corresponding path program 2 times [2025-03-04 10:18:08,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:08,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-03-04 10:18:08,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:08,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:08,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:18:08,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-04 10:18:08,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:08,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:08,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64727775] [2025-03-04 10:18:08,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64727775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:08,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:08,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:18:08,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240864650] [2025-03-04 10:18:08,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:08,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:18:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:08,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:18:08,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:18:08,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:08,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:08,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:08,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:08,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:09,027 INFO L124 PetriNetUnfolderBase]: 888/1476 cut-off events. [2025-03-04 10:18:09,027 INFO L125 PetriNetUnfolderBase]: For 2659/2659 co-relation queries the response was YES. [2025-03-04 10:18:09,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5033 conditions, 1476 events. 888/1476 cut-off events. For 2659/2659 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6896 event pairs, 461 based on Foata normal form. 32/1508 useless extension candidates. Maximal degree in co-relation 4396. Up to 1147 conditions per place. [2025-03-04 10:18:09,034 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 71 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2025-03-04 10:18:09,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 729 flow [2025-03-04 10:18:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:18:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:18:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-03-04 10:18:09,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-03-04 10:18:09,036 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 453 flow. Second operand 4 states and 118 transitions. [2025-03-04 10:18:09,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 729 flow [2025-03-04 10:18:09,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 702 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:09,043 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 448 flow [2025-03-04 10:18:09,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=448, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-03-04 10:18:09,044 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2025-03-04 10:18:09,044 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 448 flow [2025-03-04 10:18:09,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:09,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:09,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 10:18:09,044 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:09,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:09,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1574544197, now seen corresponding path program 1 times [2025-03-04 10:18:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:09,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-03-04 10:18:09,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:09,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:18:09,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:09,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:09,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:09,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:09,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:09,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-03-04 10:18:09,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329802412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:09,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:09,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:09,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140138046] [2025-03-04 10:18:09,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:09,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:09,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:09,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:09,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:09,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:09,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:09,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:09,418 INFO L124 PetriNetUnfolderBase]: 1028/1728 cut-off events. [2025-03-04 10:18:09,418 INFO L125 PetriNetUnfolderBase]: For 3625/3625 co-relation queries the response was YES. [2025-03-04 10:18:09,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6212 conditions, 1728 events. 1028/1728 cut-off events. For 3625/3625 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8952 event pairs, 319 based on Foata normal form. 24/1752 useless extension candidates. Maximal degree in co-relation 5557. Up to 860 conditions per place. [2025-03-04 10:18:09,424 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 104 selfloop transitions, 20 changer transitions 0/125 dead transitions. [2025-03-04 10:18:09,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 125 transitions, 1092 flow [2025-03-04 10:18:09,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:09,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-03-04 10:18:09,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-04 10:18:09,426 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 448 flow. Second operand 6 states and 184 transitions. [2025-03-04 10:18:09,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 125 transitions, 1092 flow [2025-03-04 10:18:09,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 125 transitions, 1047 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:09,435 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 631 flow [2025-03-04 10:18:09,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=631, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-03-04 10:18:09,435 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2025-03-04 10:18:09,435 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 631 flow [2025-03-04 10:18:09,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:09,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:09,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 10:18:09,436 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:09,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:09,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1879938681, now seen corresponding path program 2 times [2025-03-04 10:18:09,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:09,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774416028] [2025-03-04 10:18:09,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:09,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:09,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:18:09,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-04 10:18:09,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:09,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:09,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:09,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:09,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774416028] [2025-03-04 10:18:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774416028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:09,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:09,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:09,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824142220] [2025-03-04 10:18:09,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:09,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:09,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:09,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:09,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:09,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:09,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:09,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:09,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:09,803 INFO L124 PetriNetUnfolderBase]: 1278/2166 cut-off events. [2025-03-04 10:18:09,803 INFO L125 PetriNetUnfolderBase]: For 6140/6140 co-relation queries the response was YES. [2025-03-04 10:18:09,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8261 conditions, 2166 events. 1278/2166 cut-off events. For 6140/6140 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11223 event pairs, 473 based on Foata normal form. 24/2190 useless extension candidates. Maximal degree in co-relation 7474. Up to 1129 conditions per place. [2025-03-04 10:18:09,812 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 105 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2025-03-04 10:18:09,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 1278 flow [2025-03-04 10:18:09,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:18:09,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:18:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-03-04 10:18:09,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5863095238095238 [2025-03-04 10:18:09,814 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 631 flow. Second operand 7 states and 197 transitions. [2025-03-04 10:18:09,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 1278 flow [2025-03-04 10:18:09,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 133 transitions, 1244 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:09,826 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 794 flow [2025-03-04 10:18:09,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=794, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2025-03-04 10:18:09,826 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2025-03-04 10:18:09,826 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 794 flow [2025-03-04 10:18:09,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:09,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:09,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:18:09,827 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:09,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash 418757597, now seen corresponding path program 3 times [2025-03-04 10:18:09,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:09,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210598440] [2025-03-04 10:18:09,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:09,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:09,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:18:09,835 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-04 10:18:09,835 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 10:18:09,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:09,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:09,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210598440] [2025-03-04 10:18:09,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210598440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:09,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:09,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:09,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342933002] [2025-03-04 10:18:09,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:09,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:09,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:09,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:09,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:09,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:09,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 794 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:09,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:09,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:09,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:10,118 INFO L124 PetriNetUnfolderBase]: 1258/2110 cut-off events. [2025-03-04 10:18:10,119 INFO L125 PetriNetUnfolderBase]: For 8269/8269 co-relation queries the response was YES. [2025-03-04 10:18:10,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8586 conditions, 2110 events. 1258/2110 cut-off events. For 8269/8269 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11041 event pairs, 463 based on Foata normal form. 6/2116 useless extension candidates. Maximal degree in co-relation 7787. Up to 1064 conditions per place. [2025-03-04 10:18:10,128 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 95 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2025-03-04 10:18:10,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 124 transitions, 1320 flow [2025-03-04 10:18:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-03-04 10:18:10,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-04 10:18:10,129 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 794 flow. Second operand 5 states and 155 transitions. [2025-03-04 10:18:10,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 124 transitions, 1320 flow [2025-03-04 10:18:10,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 124 transitions, 1266 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:10,146 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 880 flow [2025-03-04 10:18:10,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=880, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-04 10:18:10,146 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2025-03-04 10:18:10,146 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 880 flow [2025-03-04 10:18:10,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:10,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:10,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 10:18:10,147 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash 148280907, now seen corresponding path program 4 times [2025-03-04 10:18:10,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:10,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-03-04 10:18:10,149 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:10,154 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:18:10,162 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:10,163 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:10,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274432791] [2025-03-04 10:18:10,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274432791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:10,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:10,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:10,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827620500] [2025-03-04 10:18:10,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:10,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:10,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:10,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:10,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:10,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:10,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:10,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:10,402 INFO L124 PetriNetUnfolderBase]: 1252/2104 cut-off events. [2025-03-04 10:18:10,402 INFO L125 PetriNetUnfolderBase]: For 10026/10026 co-relation queries the response was YES. [2025-03-04 10:18:10,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8834 conditions, 2104 events. 1252/2104 cut-off events. For 10026/10026 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10693 event pairs, 647 based on Foata normal form. 6/2110 useless extension candidates. Maximal degree in co-relation 8039. Up to 1651 conditions per place. [2025-03-04 10:18:10,412 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 77 selfloop transitions, 36 changer transitions 0/114 dead transitions. [2025-03-04 10:18:10,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 114 transitions, 1361 flow [2025-03-04 10:18:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:18:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:18:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-04 10:18:10,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-04 10:18:10,413 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 880 flow. Second operand 5 states and 145 transitions. [2025-03-04 10:18:10,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 114 transitions, 1361 flow [2025-03-04 10:18:10,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 114 transitions, 1305 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:10,431 INFO L231 Difference]: Finished difference. Result has 93 places, 96 transitions, 1129 flow [2025-03-04 10:18:10,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1129, PETRI_PLACES=93, PETRI_TRANSITIONS=96} [2025-03-04 10:18:10,431 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2025-03-04 10:18:10,431 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 96 transitions, 1129 flow [2025-03-04 10:18:10,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:10,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:10,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:18:10,432 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:10,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:10,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1535153555, now seen corresponding path program 5 times [2025-03-04 10:18:10,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:10,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936969354] [2025-03-04 10:18:10,433 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:18:10,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:10,437 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-04 10:18:10,444 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:18:10,444 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:18:10,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:10,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936969354] [2025-03-04 10:18:10,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936969354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:10,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:18:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59341013] [2025-03-04 10:18:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:10,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:18:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:10,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:18:10,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:18:10,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:10,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 1129 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:10,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:10,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:10,807 INFO L124 PetriNetUnfolderBase]: 1210/2020 cut-off events. [2025-03-04 10:18:10,808 INFO L125 PetriNetUnfolderBase]: For 10720/10720 co-relation queries the response was YES. [2025-03-04 10:18:10,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 2020 events. 1210/2020 cut-off events. For 10720/10720 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10044 event pairs, 591 based on Foata normal form. 24/2044 useless extension candidates. Maximal degree in co-relation 7828. Up to 1519 conditions per place. [2025-03-04 10:18:10,815 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 85 selfloop transitions, 38 changer transitions 0/124 dead transitions. [2025-03-04 10:18:10,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 124 transitions, 1514 flow [2025-03-04 10:18:10,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:10,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-03-04 10:18:10,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 10:18:10,816 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 1129 flow. Second operand 6 states and 171 transitions. [2025-03-04 10:18:10,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 124 transitions, 1514 flow [2025-03-04 10:18:10,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 124 transitions, 1463 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:10,833 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 1225 flow [2025-03-04 10:18:10,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1225, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2025-03-04 10:18:10,833 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2025-03-04 10:18:10,833 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 1225 flow [2025-03-04 10:18:10,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:10,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:10,834 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-04 10:18:10,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 10:18:10,834 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:10,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:10,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1366391628, now seen corresponding path program 1 times [2025-03-04 10:18:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:10,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-03-04 10:18:10,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:10,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:18:10,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:18:10,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:10,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:10,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:10,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:10,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331989553] [2025-03-04 10:18:10,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331989553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:10,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:10,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:18:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777526306] [2025-03-04 10:18:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:10,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:18:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:10,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:18:10,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:18:11,037 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:11,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 1225 flow. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:11,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:11,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:11,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:11,679 INFO L124 PetriNetUnfolderBase]: 2052/3477 cut-off events. [2025-03-04 10:18:11,679 INFO L125 PetriNetUnfolderBase]: For 16012/16012 co-relation queries the response was YES. [2025-03-04 10:18:11,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14506 conditions, 3477 events. 2052/3477 cut-off events. For 16012/16012 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20236 event pairs, 397 based on Foata normal form. 60/3537 useless extension candidates. Maximal degree in co-relation 13268. Up to 1024 conditions per place. [2025-03-04 10:18:11,699 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 225 selfloop transitions, 72 changer transitions 0/298 dead transitions. [2025-03-04 10:18:11,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 298 transitions, 3524 flow [2025-03-04 10:18:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:18:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:18:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 342 transitions. [2025-03-04 10:18:11,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2025-03-04 10:18:11,701 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 1225 flow. Second operand 11 states and 342 transitions. [2025-03-04 10:18:11,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 298 transitions, 3524 flow [2025-03-04 10:18:11,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 298 transitions, 3358 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-03-04 10:18:11,740 INFO L231 Difference]: Finished difference. Result has 116 places, 147 transitions, 2061 flow [2025-03-04 10:18:11,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2061, PETRI_PLACES=116, PETRI_TRANSITIONS=147} [2025-03-04 10:18:11,741 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 69 predicate places. [2025-03-04 10:18:11,741 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 147 transitions, 2061 flow [2025-03-04 10:18:11,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:11,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:11,741 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-04 10:18:11,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:18:11,742 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:11,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:11,742 INFO L85 PathProgramCache]: Analyzing trace with hash 235064532, now seen corresponding path program 2 times [2025-03-04 10:18:11,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:11,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211575837] [2025-03-04 10:18:11,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:11,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:11,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:18:11,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-03-04 10:18:11,756 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:11,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:18:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:11,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211575837] [2025-03-04 10:18:11,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211575837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:11,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:11,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:18:11,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295212719] [2025-03-04 10:18:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:11,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:18:11,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:11,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:18:11,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:18:11,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:11,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 147 transitions, 2061 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:11,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:11,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:11,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:12,199 INFO L124 PetriNetUnfolderBase]: 2028/3473 cut-off events. [2025-03-04 10:18:12,200 INFO L125 PetriNetUnfolderBase]: For 24791/24791 co-relation queries the response was YES. [2025-03-04 10:18:12,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17248 conditions, 3473 events. 2028/3473 cut-off events. For 24791/24791 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 19898 event pairs, 788 based on Foata normal form. 78/3551 useless extension candidates. Maximal degree in co-relation 16298. Up to 2092 conditions per place. [2025-03-04 10:18:12,254 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 165 selfloop transitions, 67 changer transitions 0/233 dead transitions. [2025-03-04 10:18:12,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 233 transitions, 3475 flow [2025-03-04 10:18:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:18:12,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:18:12,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-03-04 10:18:12,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2025-03-04 10:18:12,255 INFO L175 Difference]: Start difference. First operand has 116 places, 147 transitions, 2061 flow. Second operand 6 states and 169 transitions. [2025-03-04 10:18:12,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 233 transitions, 3475 flow [2025-03-04 10:18:12,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 3364 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-04 10:18:12,301 INFO L231 Difference]: Finished difference. Result has 123 places, 165 transitions, 2495 flow [2025-03-04 10:18:12,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1986, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2495, PETRI_PLACES=123, PETRI_TRANSITIONS=165} [2025-03-04 10:18:12,302 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 76 predicate places. [2025-03-04 10:18:12,302 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 165 transitions, 2495 flow [2025-03-04 10:18:12,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:12,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:12,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:12,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:18:12,302 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:12,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1364669770, now seen corresponding path program 1 times [2025-03-04 10:18:12,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:12,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-03-04 10:18:12,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:12,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:12,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786358373] [2025-03-04 10:18:12,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786358373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:12,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:12,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:12,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876434120] [2025-03-04 10:18:12,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:12,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:12,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:12,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:12,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:12,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-03-04 10:18:12,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 165 transitions, 2495 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:12,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:12,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-03-04 10:18:12,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:13,037 INFO L124 PetriNetUnfolderBase]: 2179/3849 cut-off events. [2025-03-04 10:18:13,037 INFO L125 PetriNetUnfolderBase]: For 30977/30985 co-relation queries the response was YES. [2025-03-04 10:18:13,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19609 conditions, 3849 events. 2179/3849 cut-off events. For 30977/30985 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 23735 event pairs, 437 based on Foata normal form. 20/3869 useless extension candidates. Maximal degree in co-relation 18503. Up to 1037 conditions per place. [2025-03-04 10:18:13,056 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 249 selfloop transitions, 99 changer transitions 0/350 dead transitions. [2025-03-04 10:18:13,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 350 transitions, 4648 flow [2025-03-04 10:18:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:18:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 10:18:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 395 transitions. [2025-03-04 10:18:13,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6330128205128205 [2025-03-04 10:18:13,058 INFO L175 Difference]: Start difference. First operand has 123 places, 165 transitions, 2495 flow. Second operand 13 states and 395 transitions. [2025-03-04 10:18:13,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 350 transitions, 4648 flow [2025-03-04 10:18:13,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 4496 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:13,127 INFO L231 Difference]: Finished difference. Result has 139 places, 209 transitions, 3228 flow [2025-03-04 10:18:13,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3228, PETRI_PLACES=139, PETRI_TRANSITIONS=209} [2025-03-04 10:18:13,128 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 92 predicate places. [2025-03-04 10:18:13,128 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 209 transitions, 3228 flow [2025-03-04 10:18:13,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:13,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:13,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:13,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 10:18:13,129 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:13,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:13,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1717415190, now seen corresponding path program 1 times [2025-03-04 10:18:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824242697] [2025-03-04 10:18:13,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:13,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:13,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:13,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:13,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:13,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:13,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:13,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824242697] [2025-03-04 10:18:13,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824242697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:13,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233827440] [2025-03-04 10:18:13,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:18:13,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:13,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:13,242 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-04 10:18:13,243 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-04 10:18:13,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:18:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:18:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:13,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:18:13,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:13,317 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-04 10:18:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:13,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:17,715 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 90 treesize of output 80 [2025-03-04 10:18:17,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:18:17,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 159 [2025-03-04 10:18:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:19,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233827440] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:19,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:19,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-03-04 10:18:19,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727269897] [2025-03-04 10:18:19,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:19,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:18:19,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:19,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:18:19,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=307, Unknown=1, NotChecked=0, Total=380 [2025-03-04 10:18:20,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-03-04 10:18:20,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 209 transitions, 3228 flow. Second operand has 20 states, 20 states have (on average 22.15) internal successors, (443), 20 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:20,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:20,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-03-04 10:18:20,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:22,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:18:25,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:18:28,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:18:33,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:18:37,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:18:41,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:18:42,859 INFO L124 PetriNetUnfolderBase]: 5033/8693 cut-off events. [2025-03-04 10:18:42,859 INFO L125 PetriNetUnfolderBase]: For 69197/69244 co-relation queries the response was YES. [2025-03-04 10:18:42,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44885 conditions, 8693 events. 5033/8693 cut-off events. For 69197/69244 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 57471 event pairs, 275 based on Foata normal form. 53/8741 useless extension candidates. Maximal degree in co-relation 43981. Up to 1441 conditions per place. [2025-03-04 10:18:42,901 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 426 selfloop transitions, 247 changer transitions 272/953 dead transitions. [2025-03-04 10:18:42,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 953 transitions, 12133 flow [2025-03-04 10:18:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 10:18:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 10:18:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 1761 transitions. [2025-03-04 10:18:42,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5823412698412699 [2025-03-04 10:18:42,905 INFO L175 Difference]: Start difference. First operand has 139 places, 209 transitions, 3228 flow. Second operand 63 states and 1761 transitions. [2025-03-04 10:18:42,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 953 transitions, 12133 flow [2025-03-04 10:18:43,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 953 transitions, 11757 flow, removed 113 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:43,094 INFO L231 Difference]: Finished difference. Result has 230 places, 344 transitions, 5210 flow [2025-03-04 10:18:43,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=5210, PETRI_PLACES=230, PETRI_TRANSITIONS=344} [2025-03-04 10:18:43,095 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 183 predicate places. [2025-03-04 10:18:43,095 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 344 transitions, 5210 flow [2025-03-04 10:18:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 22.15) internal successors, (443), 20 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:43,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:43,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:43,101 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-04 10:18:43,295 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,SelfDestructingSolverStorable24 [2025-03-04 10:18:43,296 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:43,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -423556974, now seen corresponding path program 2 times [2025-03-04 10:18:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686494394] [2025-03-04 10:18:43,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:18:43,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:43,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:43,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-04 10:18:43,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:18:43,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:43,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686494394] [2025-03-04 10:18:43,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686494394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:18:43,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:18:43,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 10:18:43,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10118429] [2025-03-04 10:18:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:18:43,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:18:43,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:43,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:18:43,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:18:43,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:43,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 344 transitions, 5210 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 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-04 10:18:43,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:43,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:43,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:44,533 INFO L124 PetriNetUnfolderBase]: 3737/6412 cut-off events. [2025-03-04 10:18:44,534 INFO L125 PetriNetUnfolderBase]: For 94809/94809 co-relation queries the response was YES. [2025-03-04 10:18:44,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41220 conditions, 6412 events. 3737/6412 cut-off events. For 94809/94809 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 39046 event pairs, 1263 based on Foata normal form. 6/6418 useless extension candidates. Maximal degree in co-relation 40851. Up to 3204 conditions per place. [2025-03-04 10:18:44,582 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 364 selfloop transitions, 108 changer transitions 0/473 dead transitions. [2025-03-04 10:18:44,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 473 transitions, 7536 flow [2025-03-04 10:18:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:18:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:18:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 288 transitions. [2025-03-04 10:18:44,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 10:18:44,583 INFO L175 Difference]: Start difference. First operand has 230 places, 344 transitions, 5210 flow. Second operand 9 states and 288 transitions. [2025-03-04 10:18:44,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 473 transitions, 7536 flow [2025-03-04 10:18:44,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 473 transitions, 6700 flow, removed 349 selfloop flow, removed 18 redundant places. [2025-03-04 10:18:44,941 INFO L231 Difference]: Finished difference. Result has 210 places, 357 transitions, 5069 flow [2025-03-04 10:18:44,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4524, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5069, PETRI_PLACES=210, PETRI_TRANSITIONS=357} [2025-03-04 10:18:44,941 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 163 predicate places. [2025-03-04 10:18:44,942 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 357 transitions, 5069 flow [2025-03-04 10:18:44,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 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-04 10:18:44,942 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:44,942 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:44,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:18:44,942 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:44,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 277830124, now seen corresponding path program 3 times [2025-03-04 10:18:44,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:44,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322449414] [2025-03-04 10:18:44,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:44,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:44,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:44,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:18:44,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:45,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:45,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322449414] [2025-03-04 10:18:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322449414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:45,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515851465] [2025-03-04 10:18:45,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:18:45,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:45,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:45,053 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-04 10:18:45,053 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-04 10:18:45,091 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:45,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:45,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:18:45,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:45,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:18:45,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:45,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515851465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:45,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-04 10:18:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305359743] [2025-03-04 10:18:45,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:45,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:18:45,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:45,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:18:45,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:18:45,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:45,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 357 transitions, 5069 flow. Second operand has 16 states, 16 states have (on average 20.5) internal successors, (328), 16 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:45,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:45,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:45,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:18:46,635 INFO L124 PetriNetUnfolderBase]: 4346/7544 cut-off events. [2025-03-04 10:18:46,635 INFO L125 PetriNetUnfolderBase]: For 96746/96746 co-relation queries the response was YES. [2025-03-04 10:18:46,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46730 conditions, 7544 events. 4346/7544 cut-off events. For 96746/96746 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 48483 event pairs, 1575 based on Foata normal form. 32/7576 useless extension candidates. Maximal degree in co-relation 46478. Up to 4544 conditions per place. [2025-03-04 10:18:46,689 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 401 selfloop transitions, 247 changer transitions 4/653 dead transitions. [2025-03-04 10:18:46,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 653 transitions, 9708 flow [2025-03-04 10:18:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 10:18:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-04 10:18:46,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 625 transitions. [2025-03-04 10:18:46,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425347222222222 [2025-03-04 10:18:46,690 INFO L175 Difference]: Start difference. First operand has 210 places, 357 transitions, 5069 flow. Second operand 24 states and 625 transitions. [2025-03-04 10:18:46,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 653 transitions, 9708 flow [2025-03-04 10:18:46,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 653 transitions, 9638 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 10:18:46,986 INFO L231 Difference]: Finished difference. Result has 245 places, 514 transitions, 8159 flow [2025-03-04 10:18:46,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4923, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8159, PETRI_PLACES=245, PETRI_TRANSITIONS=514} [2025-03-04 10:18:46,986 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 198 predicate places. [2025-03-04 10:18:46,987 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 514 transitions, 8159 flow [2025-03-04 10:18:46,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.5) internal successors, (328), 16 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:46,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:18:46,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:18:46,993 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-04 10:18:47,187 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,SelfDestructingSolverStorable26 [2025-03-04 10:18:47,187 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:18:47,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:18:47,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1353216730, now seen corresponding path program 4 times [2025-03-04 10:18:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:18:47,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311802368] [2025-03-04 10:18:47,188 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:47,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:18:47,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:47,200 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:47,200 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:47,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:18:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:18:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311802368] [2025-03-04 10:18:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311802368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:18:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355205325] [2025-03-04 10:18:47,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:18:47,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:18:47,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:18:47,462 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-04 10:18:47,463 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-04 10:18:47,501 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-04 10:18:47,513 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:18:47,513 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:18:47,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:18:47,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:18:47,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:18:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:47,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:18:47,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:18:47,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355205325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:18:47,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:18:47,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-04 10:18:47,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12146482] [2025-03-04 10:18:47,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:18:47,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:18:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:18:47,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:18:47,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:18:48,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:18:48,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 514 transitions, 8159 flow. Second operand has 19 states, 19 states have (on average 20.894736842105264) internal successors, (397), 19 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:18:48,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:18:48,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:18:48,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:09,121 INFO L124 PetriNetUnfolderBase]: 5628/9887 cut-off events. [2025-03-04 10:19:09,122 INFO L125 PetriNetUnfolderBase]: For 171488/171488 co-relation queries the response was YES. [2025-03-04 10:19:09,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68862 conditions, 9887 events. 5628/9887 cut-off events. For 171488/171488 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 68239 event pairs, 559 based on Foata normal form. 60/9947 useless extension candidates. Maximal degree in co-relation 67901. Up to 2320 conditions per place. [2025-03-04 10:19:09,189 INFO L140 encePairwiseOnDemand]: 28/48 looper letters, 340 selfloop transitions, 359 changer transitions 640/1340 dead transitions. [2025-03-04 10:19:09,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1340 transitions, 20980 flow [2025-03-04 10:19:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-04 10:19:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-04 10:19:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 2163 transitions. [2025-03-04 10:19:09,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5239825581395349 [2025-03-04 10:19:09,193 INFO L175 Difference]: Start difference. First operand has 245 places, 514 transitions, 8159 flow. Second operand 86 states and 2163 transitions. [2025-03-04 10:19:09,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1340 transitions, 20980 flow [2025-03-04 10:19:09,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1340 transitions, 20175 flow, removed 260 selfloop flow, removed 10 redundant places. [2025-03-04 10:19:09,915 INFO L231 Difference]: Finished difference. Result has 351 places, 522 transitions, 8705 flow [2025-03-04 10:19:09,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7628, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=8705, PETRI_PLACES=351, PETRI_TRANSITIONS=522} [2025-03-04 10:19:09,919 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 304 predicate places. [2025-03-04 10:19:09,919 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 522 transitions, 8705 flow [2025-03-04 10:19:09,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 20.894736842105264) internal successors, (397), 19 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:09,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:09,919 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:09,926 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-04 10:19:10,119 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,SelfDestructingSolverStorable27 [2025-03-04 10:19:10,120 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:19:10,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash 111342246, now seen corresponding path program 2 times [2025-03-04 10:19:10,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:10,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635185333] [2025-03-04 10:19:10,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:19:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:10,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:19:10,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:19:10,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:19:10,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:19:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635185333] [2025-03-04 10:19:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635185333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:19:10,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165692964] [2025-03-04 10:19:10,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:19:10,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:10,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:10,436 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-04 10:19:10,437 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-04 10:19:10,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 10:19:10,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:19:10,517 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:19:10,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:10,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:19:10,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:19:10,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:19:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:19:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165692964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:19:10,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:19:10,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2025-03-04 10:19:10,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533173264] [2025-03-04 10:19:10,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:19:10,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 10:19:10,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:10,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 10:19:10,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:19:10,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:19:10,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 522 transitions, 8705 flow. Second operand has 21 states, 21 states have (on average 19.904761904761905) internal successors, (418), 21 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:10,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:10,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:19:10,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:19:15,779 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 [] [2025-03-04 10:19:27,131 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 [] [2025-03-04 10:19:27,999 INFO L124 PetriNetUnfolderBase]: 3833/6886 cut-off events. [2025-03-04 10:19:27,999 INFO L125 PetriNetUnfolderBase]: For 168131/168131 co-relation queries the response was YES. [2025-03-04 10:19:28,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55116 conditions, 6886 events. 3833/6886 cut-off events. For 168131/168131 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 45793 event pairs, 579 based on Foata normal form. 12/6898 useless extension candidates. Maximal degree in co-relation 54992. Up to 1676 conditions per place. [2025-03-04 10:19:28,054 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 515 selfloop transitions, 406 changer transitions 0/922 dead transitions. [2025-03-04 10:19:28,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 922 transitions, 16394 flow [2025-03-04 10:19:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 10:19:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 10:19:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 883 transitions. [2025-03-04 10:19:28,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255952380952381 [2025-03-04 10:19:28,056 INFO L175 Difference]: Start difference. First operand has 351 places, 522 transitions, 8705 flow. Second operand 35 states and 883 transitions. [2025-03-04 10:19:28,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 922 transitions, 16394 flow [2025-03-04 10:19:28,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 922 transitions, 14122 flow, removed 1084 selfloop flow, removed 32 redundant places. [2025-03-04 10:19:28,718 INFO L231 Difference]: Finished difference. Result has 289 places, 667 transitions, 10916 flow [2025-03-04 10:19:28,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7564, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=10916, PETRI_PLACES=289, PETRI_TRANSITIONS=667} [2025-03-04 10:19:28,719 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 242 predicate places. [2025-03-04 10:19:28,719 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 667 transitions, 10916 flow [2025-03-04 10:19:28,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 19.904761904761905) internal successors, (418), 21 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:28,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:19:28,720 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:19:28,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:19:28,920 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,SelfDestructingSolverStorable28 [2025-03-04 10:19:28,920 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-04 10:19:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:19:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash 643683588, now seen corresponding path program 3 times [2025-03-04 10:19:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:19:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-04 10:19:28,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:19:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:19:28,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-04 10:19:28,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 10:19:28,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:19:28,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:19:29,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:19:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44848064] [2025-03-04 10:19:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44848064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:19:29,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14708686] [2025-03-04 10:19:29,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:19:29,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:19:29,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:19:29,157 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-04 10:19:29,158 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-04 10:19:29,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-04 10:19:29,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 25 statements. [2025-03-04 10:19:29,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:19:29,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:19:29,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:19:29,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:19:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:19:29,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:19:29,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:19:29,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14708686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:19:29,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:19:29,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2025-03-04 10:19:29,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883254648] [2025-03-04 10:19:29,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:19:29,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:19:29,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:19:29,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:19:29,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:19:29,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-04 10:19:29,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 667 transitions, 10916 flow. Second operand has 19 states, 19 states have (on average 19.894736842105264) internal successors, (378), 19 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:19:29,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:19:29,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-04 10:19:29,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand