./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-cond-4.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 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:30:51,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:30:51,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:30:51,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:30:51,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:30:52,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:30:52,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:30:52,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:30:52,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:30:52,006 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:30:52,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:30:52,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:30:52,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:30:52,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:30:52,006 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:30:52,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:30:52,006 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:30:52,007 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:30:52,008 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:52,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:30:52,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:30:52,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:30:52,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:30:52,009 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 -> 6b28fb6889d0d92f72216f98e0edff81bbc7a955814acfd4caad3db76eb7ead3 [2025-03-09 01:30:52,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:30:52,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:30:52,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:30:52,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:30:52,223 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:30:52,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-03-09 01:30:53,362 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa89da60b/a7a782b72d774b8f8d35ccde0ff547bc/FLAG079b48f78 [2025-03-09 01:30:53,600 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:30:53,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-4.wvr.c [2025-03-09 01:30:53,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa89da60b/a7a782b72d774b8f8d35ccde0ff547bc/FLAG079b48f78 [2025-03-09 01:30:53,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa89da60b/a7a782b72d774b8f8d35ccde0ff547bc [2025-03-09 01:30:53,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:30:53,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:30:53,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:53,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:30:53,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:30:53,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:53" (1/1) ... [2025-03-09 01:30:53,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3efbafe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:53, skipping insertion in model container [2025-03-09 01:30:53,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:53" (1/1) ... [2025-03-09 01:30:53,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:30:54,090 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-09 01:30:54,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:54,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:30:54,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:54,139 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:30:54,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54 WrapperNode [2025-03-09 01:30:54,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:54,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:54,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:30:54,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:30:54,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,171 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 169 [2025-03-09 01:30:54,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:54,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:30:54,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:30:54,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:30:54,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,201 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 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-09 01:30:54,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:30:54,211 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:30:54,211 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:30:54,211 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:30:54,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (1/1) ... [2025-03-09 01:30:54,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:54,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:54,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:30:54,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:30:54,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:30:54,250 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:30:54,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:30:54,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:30:54,251 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:30:54,326 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:30:54,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:30:54,654 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:30:54,654 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:30:54,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:30:54,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:30:54,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:54 BoogieIcfgContainer [2025-03-09 01:30:54,821 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:30:54,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:30:54,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:30:54,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:30:54,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:30:53" (1/3) ... [2025-03-09 01:30:54,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fffe240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:54, skipping insertion in model container [2025-03-09 01:30:54,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:54" (2/3) ... [2025-03-09 01:30:54,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fffe240 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:54, skipping insertion in model container [2025-03-09 01:30:54,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:54" (3/3) ... [2025-03-09 01:30:54,829 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-4.wvr.c [2025-03-09 01:30:54,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:30:54,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-4.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 3 loop locations, and 20 error locations. [2025-03-09 01:30:54,842 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:30:54,897 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:30:54,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 56 transitions, 126 flow [2025-03-09 01:30:54,946 INFO L124 PetriNetUnfolderBase]: 6/54 cut-off events. [2025-03-09 01:30:54,949 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:54,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 54 events. 6/54 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-09 01:30:54,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 56 transitions, 126 flow [2025-03-09 01:30:54,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 53 transitions, 118 flow [2025-03-09 01:30:54,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:30:54,974 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;@5932049b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:30:54,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-09 01:30:54,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:30:54,980 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:30:54,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:30:54,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:54,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:54,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:54,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:54,985 INFO L85 PathProgramCache]: Analyzing trace with hash 513415, now seen corresponding path program 1 times [2025-03-09 01:30:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:54,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166064809] [2025-03-09 01:30:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:55,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:55,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:55,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:55,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166064809] [2025-03-09 01:30:55,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166064809] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:55,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:55,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:30:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887250955] [2025-03-09 01:30:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:55,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:55,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:55,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:55,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-09 01:30:55,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 118 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-09 01:30:55,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:55,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-09 01:30:55,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:55,363 INFO L124 PetriNetUnfolderBase]: 192/424 cut-off events. [2025-03-09 01:30:55,364 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 01:30:55,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 424 events. 192/424 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2208 event pairs, 120 based on Foata normal form. 1/332 useless extension candidates. Maximal degree in co-relation 652. Up to 298 conditions per place. [2025-03-09 01:30:55,369 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2025-03-09 01:30:55,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 168 flow [2025-03-09 01:30:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2025-03-09 01:30:55,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-09 01:30:55,381 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 118 flow. Second operand 3 states and 105 transitions. [2025-03-09 01:30:55,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 168 flow [2025-03-09 01:30:55,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:55,388 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 108 flow [2025-03-09 01:30:55,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2025-03-09 01:30:55,394 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2025-03-09 01:30:55,394 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 108 flow [2025-03-09 01:30:55,394 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-09 01:30:55,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:55,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:55,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:30:55,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:55,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 513416, now seen corresponding path program 1 times [2025-03-09 01:30:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899704709] [2025-03-09 01:30:55,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:55,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:55,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:55,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:55,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899704709] [2025-03-09 01:30:55,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899704709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:55,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:55,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:55,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307291803] [2025-03-09 01:30:55,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:55,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:55,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:55,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-09 01:30:55,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:55,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-09 01:30:55,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:55,817 INFO L124 PetriNetUnfolderBase]: 193/427 cut-off events. [2025-03-09 01:30:55,817 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:30:55,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 427 events. 193/427 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2219 event pairs, 120 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 720. Up to 303 conditions per place. [2025-03-09 01:30:55,819 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 29 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2025-03-09 01:30:55,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 180 flow [2025-03-09 01:30:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-09 01:30:55,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-09 01:30:55,823 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 108 flow. Second operand 3 states and 108 transitions. [2025-03-09 01:30:55,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 180 flow [2025-03-09 01:30:55,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:55,825 INFO L231 Difference]: Finished difference. Result has 50 places, 52 transitions, 123 flow [2025-03-09 01:30:55,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=52} [2025-03-09 01:30:55,827 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2025-03-09 01:30:55,827 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 123 flow [2025-03-09 01:30:55,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:55,828 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:30:55,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:30:55,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:55,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash 493408394, now seen corresponding path program 1 times [2025-03-09 01:30:55,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378456614] [2025-03-09 01:30:55,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:55,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:55,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:55,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:55,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:56,065 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-09 01:30:56,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378456614] [2025-03-09 01:30:56,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378456614] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:56,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887154038] [2025-03-09 01:30:56,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:56,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:56,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:56,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:56,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:30:56,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:56,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:56,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:56,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:56,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:56,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:56,150 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-09 01:30:56,316 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-09 01:30:56,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:56,400 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-09 01:30:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887154038] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:56,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228079537] [2025-03-09 01:30:56,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:56,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:56,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:56,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:56,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-09 01:30:56,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 123 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:56,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:56,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-09 01:30:56,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:56,825 INFO L124 PetriNetUnfolderBase]: 193/426 cut-off events. [2025-03-09 01:30:56,825 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:30:56,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 426 events. 193/426 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2229 event pairs, 120 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 720. Up to 299 conditions per place. [2025-03-09 01:30:56,828 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 25 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2025-03-09 01:30:56,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 183 flow [2025-03-09 01:30:56,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2025-03-09 01:30:56,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5607142857142857 [2025-03-09 01:30:56,831 INFO L175 Difference]: Start difference. First operand has 50 places, 52 transitions, 123 flow. Second operand 5 states and 157 transitions. [2025-03-09 01:30:56,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 183 flow [2025-03-09 01:30:56,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:56,832 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 136 flow [2025-03-09 01:30:56,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-03-09 01:30:56,833 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 01:30:56,833 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 136 flow [2025-03-09 01:30:56,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:56,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:56,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:30:56,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:57,040 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-09 01:30:57,041 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:57,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1881596802, now seen corresponding path program 1 times [2025-03-09 01:30:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055370708] [2025-03-09 01:30:57,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:57,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:30:57,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:30:57,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:57,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:57,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055370708] [2025-03-09 01:30:57,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055370708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:57,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:57,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918628870] [2025-03-09 01:30:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:57,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:57,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:57,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:57,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 56 [2025-03-09 01:30:57,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:57,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:57,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 56 [2025-03-09 01:30:57,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:57,198 INFO L124 PetriNetUnfolderBase]: 193/378 cut-off events. [2025-03-09 01:30:57,198 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:30:57,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 378 events. 193/378 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1662 event pairs, 120 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 680. Up to 298 conditions per place. [2025-03-09 01:30:57,200 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 28 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-03-09 01:30:57,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 182 flow [2025-03-09 01:30:57,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:57,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-09 01:30:57,202 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2025-03-09 01:30:57,202 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 136 flow. Second operand 4 states and 104 transitions. [2025-03-09 01:30:57,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 182 flow [2025-03-09 01:30:57,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 169 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:57,204 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 113 flow [2025-03-09 01:30:57,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2025-03-09 01:30:57,205 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-03-09 01:30:57,205 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 113 flow [2025-03-09 01:30:57,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:57,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:57,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:30:57,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:30:57,205 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1881596801, now seen corresponding path program 1 times [2025-03-09 01:30:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:57,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592333880] [2025-03-09 01:30:57,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:57,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:57,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:30:57,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:30:57,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:57,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:57,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592333880] [2025-03-09 01:30:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592333880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:57,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:57,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:57,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380550728] [2025-03-09 01:30:57,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:57,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:57,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:57,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:57,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:57,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-03-09 01:30:57,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-09 01:30:57,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:57,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-03-09 01:30:57,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:57,330 INFO L124 PetriNetUnfolderBase]: 192/377 cut-off events. [2025-03-09 01:30:57,330 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-09 01:30:57,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 377 events. 192/377 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1671 event pairs, 120 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 672. Up to 301 conditions per place. [2025-03-09 01:30:57,331 INFO L140 encePairwiseOnDemand]: 53/56 looper letters, 28 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-09 01:30:57,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 168 flow [2025-03-09 01:30:57,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2025-03-09 01:30:57,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2025-03-09 01:30:57,333 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 113 flow. Second operand 3 states and 109 transitions. [2025-03-09 01:30:57,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 168 flow [2025-03-09 01:30:57,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:57,334 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 109 flow [2025-03-09 01:30:57,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=105, 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=109, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-09 01:30:57,335 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2025-03-09 01:30:57,335 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 109 flow [2025-03-09 01:30:57,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-09 01:30:57,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:57,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:57,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:30:57,335 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:57,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:57,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1754475069, now seen corresponding path program 1 times [2025-03-09 01:30:57,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:57,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563319793] [2025-03-09 01:30:57,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:57,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:57,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:57,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:57,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:57,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,489 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-09 01:30:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563319793] [2025-03-09 01:30:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563319793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987967301] [2025-03-09 01:30:57,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:57,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:57,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:57,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:57,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:30:57,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:57,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:57,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:57,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:57,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:57,600 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-09 01:30:57,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:57,647 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-09 01:30:57,668 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-09 01:30:57,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987967301] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:57,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:57,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:57,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720046552] [2025-03-09 01:30:57,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:57,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:57,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:57,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:57,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:57,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-09 01:30:57,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 109 flow. Second operand has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:57,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:57,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-09 01:30:57,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:58,065 INFO L124 PetriNetUnfolderBase]: 404/715 cut-off events. [2025-03-09 01:30:58,065 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 01:30:58,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 715 events. 404/715 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3576 event pairs, 129 based on Foata normal form. 0/597 useless extension candidates. Maximal degree in co-relation 1356. Up to 357 conditions per place. [2025-03-09 01:30:58,068 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 49 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-03-09 01:30:58,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 262 flow [2025-03-09 01:30:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-03-09 01:30:58,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6392857142857142 [2025-03-09 01:30:58,069 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 109 flow. Second operand 5 states and 179 transitions. [2025-03-09 01:30:58,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 262 flow [2025-03-09 01:30:58,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:58,070 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 121 flow [2025-03-09 01:30:58,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2025-03-09 01:30:58,070 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2025-03-09 01:30:58,070 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 121 flow [2025-03-09 01:30:58,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.181818181818183) internal successors, (299), 11 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:58,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:58,070 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:58,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:58,271 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-09 01:30:58,271 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:58,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1871588736, now seen corresponding path program 1 times [2025-03-09 01:30:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:58,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868823787] [2025-03-09 01:30:58,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:58,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:58,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:58,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:58,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:58,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:58,411 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-09 01:30:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:58,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868823787] [2025-03-09 01:30:58,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868823787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:58,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69128991] [2025-03-09 01:30:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:58,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:58,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:58,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:58,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:30:58,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:58,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:58,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:58,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:58,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:58,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:58,559 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-09 01:30:58,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:58,619 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-09 01:30:58,763 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-09 01:30:58,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69128991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:58,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:58,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:30:58,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430464841] [2025-03-09 01:30:58,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:58,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:30:58,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:58,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:30:58,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:30:59,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-09 01:30:59,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 121 flow. Second operand has 17 states, 17 states have (on average 26.764705882352942) internal successors, (455), 17 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:59,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-09 01:30:59,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:59,700 INFO L124 PetriNetUnfolderBase]: 866/1635 cut-off events. [2025-03-09 01:30:59,701 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-09 01:30:59,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 1635 events. 866/1635 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9849 event pairs, 360 based on Foata normal form. 0/1432 useless extension candidates. Maximal degree in co-relation 1728. Up to 601 conditions per place. [2025-03-09 01:30:59,710 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 87 selfloop transitions, 14 changer transitions 0/113 dead transitions. [2025-03-09 01:30:59,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 491 flow [2025-03-09 01:30:59,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:59,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 300 transitions. [2025-03-09 01:30:59,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6696428571428571 [2025-03-09 01:30:59,711 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 121 flow. Second operand 8 states and 300 transitions. [2025-03-09 01:30:59,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 491 flow [2025-03-09 01:30:59,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 113 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:59,715 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 226 flow [2025-03-09 01:30:59,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=226, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2025-03-09 01:30:59,716 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places. [2025-03-09 01:30:59,718 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 226 flow [2025-03-09 01:30:59,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 26.764705882352942) internal successors, (455), 17 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:59,718 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:59,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:59,919 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-09 01:30:59,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:30:59,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1909243405, now seen corresponding path program 1 times [2025-03-09 01:30:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:59,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536225095] [2025-03-09 01:30:59,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:59,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:59,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:59,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:59,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:00,038 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-09 01:31:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:00,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536225095] [2025-03-09 01:31:00,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536225095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:00,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520578144] [2025-03-09 01:31:00,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:00,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:00,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:00,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:00,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:31:00,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:31:00,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:31:00,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:00,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:00,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:31:00,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:00,156 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-09 01:31:00,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:00,206 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-09 01:31:00,226 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-09 01:31:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520578144] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:00,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:31:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22676222] [2025-03-09 01:31:00,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:00,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:31:00,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:00,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:31:00,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:31:00,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 01:31:00,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 226 flow. Second operand has 11 states, 11 states have (on average 21.727272727272727) internal successors, (239), 11 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:00,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:00,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 01:31:00,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:00,646 INFO L124 PetriNetUnfolderBase]: 1419/2399 cut-off events. [2025-03-09 01:31:00,647 INFO L125 PetriNetUnfolderBase]: For 1380/1494 co-relation queries the response was YES. [2025-03-09 01:31:00,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5792 conditions, 2399 events. 1419/2399 cut-off events. For 1380/1494 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13290 event pairs, 288 based on Foata normal form. 128/2358 useless extension candidates. Maximal degree in co-relation 3627. Up to 1619 conditions per place. [2025-03-09 01:31:00,657 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 57 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2025-03-09 01:31:00,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 434 flow [2025-03-09 01:31:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-03-09 01:31:00,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5464285714285714 [2025-03-09 01:31:00,658 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 226 flow. Second operand 5 states and 153 transitions. [2025-03-09 01:31:00,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 434 flow [2025-03-09 01:31:00,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 432 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:00,661 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 290 flow [2025-03-09 01:31:00,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2025-03-09 01:31:00,662 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2025-03-09 01:31:00,662 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 290 flow [2025-03-09 01:31:00,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.727272727272727) internal successors, (239), 11 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:00,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:00,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:00,671 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-09 01:31:00,863 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-09 01:31:00,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:00,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:00,864 INFO L85 PathProgramCache]: Analyzing trace with hash 942997148, now seen corresponding path program 1 times [2025-03-09 01:31:00,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:00,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232899656] [2025-03-09 01:31:00,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:00,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:00,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:31:00,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:31:00,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:00,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:00,994 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-09 01:31:00,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232899656] [2025-03-09 01:31:00,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232899656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:00,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111901353] [2025-03-09 01:31:00,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:00,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:00,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:00,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:01,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:31:01,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:31:01,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:31:01,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:01,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:01,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:31:01,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:01,131 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-09 01:31:01,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:01,155 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-09 01:31: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-09 01:31:01,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111901353] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:01,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:01,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-03-09 01:31:01,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804562498] [2025-03-09 01:31:01,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:01,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:31:01,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:01,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:31:01,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:31:01,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 01:31:01,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 290 flow. Second operand has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:01,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 01:31:01,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:01,816 INFO L124 PetriNetUnfolderBase]: 1479/2495 cut-off events. [2025-03-09 01:31:01,817 INFO L125 PetriNetUnfolderBase]: For 1829/1976 co-relation queries the response was YES. [2025-03-09 01:31:01,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6550 conditions, 2495 events. 1479/2495 cut-off events. For 1829/1976 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13700 event pairs, 678 based on Foata normal form. 0/2339 useless extension candidates. Maximal degree in co-relation 4018. Up to 1912 conditions per place. [2025-03-09 01:31:01,828 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 79 selfloop transitions, 15 changer transitions 0/100 dead transitions. [2025-03-09 01:31:01,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 607 flow [2025-03-09 01:31:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:31:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:31:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2025-03-09 01:31:01,830 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5612244897959183 [2025-03-09 01:31:01,830 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 290 flow. Second operand 7 states and 220 transitions. [2025-03-09 01:31:01,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 607 flow [2025-03-09 01:31:01,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 581 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:01,837 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 338 flow [2025-03-09 01:31:01,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-03-09 01:31:01,837 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-03-09 01:31:01,837 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 338 flow [2025-03-09 01:31:01,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.357142857142858) internal successors, (299), 14 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:01,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:01,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:02,038 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-09 01:31:02,038 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:02,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1037226302, now seen corresponding path program 2 times [2025-03-09 01:31:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:02,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920852592] [2025-03-09 01:31:02,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:02,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:31:02,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:31:02,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:02,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,170 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-09 01:31:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920852592] [2025-03-09 01:31:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920852592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092677565] [2025-03-09 01:31:02,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:02,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:02,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:02,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:02,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:31:02,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:31:02,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:31:02,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:02,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:31:02,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:02,237 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-09 01:31:02,350 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-09 01:31:02,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:02,455 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-09 01:31:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092677565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:02,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:31:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142132346] [2025-03-09 01:31:02,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:02,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:31:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:31:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:31:02,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 56 [2025-03-09 01:31:02,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 338 flow. Second operand has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:02,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 56 [2025-03-09 01:31:02,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:02,938 INFO L124 PetriNetUnfolderBase]: 1142/2090 cut-off events. [2025-03-09 01:31:02,939 INFO L125 PetriNetUnfolderBase]: For 1301/1301 co-relation queries the response was YES. [2025-03-09 01:31:02,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5378 conditions, 2090 events. 1142/2090 cut-off events. For 1301/1301 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12680 event pairs, 579 based on Foata normal form. 0/2026 useless extension candidates. Maximal degree in co-relation 3411. Up to 1321 conditions per place. [2025-03-09 01:31:02,949 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 68 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2025-03-09 01:31:02,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 634 flow [2025-03-09 01:31:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-03-09 01:31:02,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-03-09 01:31:02,950 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 338 flow. Second operand 5 states and 170 transitions. [2025-03-09 01:31:02,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 634 flow [2025-03-09 01:31:02,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 599 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:31:02,954 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 328 flow [2025-03-09 01:31:02,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2025-03-09 01:31:02,955 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-09 01:31:02,955 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 328 flow [2025-03-09 01:31:02,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:02,955 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:02,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:31:03,159 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-09 01:31:03,159 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:03,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:03,159 INFO L85 PathProgramCache]: Analyzing trace with hash 921950110, now seen corresponding path program 2 times [2025-03-09 01:31:03,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:03,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252561551] [2025-03-09 01:31:03,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:03,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:31:03,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-09 01:31:03,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:03,309 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-09 01:31:03,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:03,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252561551] [2025-03-09 01:31:03,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252561551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:03,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:03,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:31:03,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943852771] [2025-03-09 01:31:03,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:03,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:03,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:03,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:03,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:03,356 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 01:31:03,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:03,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 01:31:03,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:03,549 INFO L124 PetriNetUnfolderBase]: 1349/2264 cut-off events. [2025-03-09 01:31:03,549 INFO L125 PetriNetUnfolderBase]: For 2824/2824 co-relation queries the response was YES. [2025-03-09 01:31:03,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6285 conditions, 2264 events. 1349/2264 cut-off events. For 2824/2824 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 12155 event pairs, 808 based on Foata normal form. 64/2127 useless extension candidates. Maximal degree in co-relation 3834. Up to 1716 conditions per place. [2025-03-09 01:31:03,558 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 56 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2025-03-09 01:31:03,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 69 transitions, 503 flow [2025-03-09 01:31:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-09 01:31:03,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2025-03-09 01:31:03,560 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 328 flow. Second operand 5 states and 136 transitions. [2025-03-09 01:31:03,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 69 transitions, 503 flow [2025-03-09 01:31:03,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 471 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:03,563 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 312 flow [2025-03-09 01:31:03,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-03-09 01:31:03,563 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-03-09 01:31:03,564 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 312 flow [2025-03-09 01:31:03,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:03,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:03,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:31:03,564 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:03,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:03,564 INFO L85 PathProgramCache]: Analyzing trace with hash -18838298, now seen corresponding path program 1 times [2025-03-09 01:31:03,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:03,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966830840] [2025-03-09 01:31:03,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:03,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:03,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:31:03,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:31:03,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:03,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:03,696 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-09 01:31:03,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966830840] [2025-03-09 01:31:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966830840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962174625] [2025-03-09 01:31:03,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:03,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:03,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:03,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:31:03,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:31:03,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:31:03,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:03,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:03,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:31:03,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:03,843 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-09 01:31:03,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:03,885 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-09 01:31:04,018 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-09 01:31:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962174625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:04,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-03-09 01:31:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583240516] [2025-03-09 01:31:04,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 01:31:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:04,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 01:31:04,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-03-09 01:31:04,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 01:31:04,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 312 flow. Second operand has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:04,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:04,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 01:31:04,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:04,647 INFO L124 PetriNetUnfolderBase]: 1258/2114 cut-off events. [2025-03-09 01:31:04,648 INFO L125 PetriNetUnfolderBase]: For 1776/1776 co-relation queries the response was YES. [2025-03-09 01:31:04,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5547 conditions, 2114 events. 1258/2114 cut-off events. For 1776/1776 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11172 event pairs, 605 based on Foata normal form. 16/2024 useless extension candidates. Maximal degree in co-relation 3630. Up to 986 conditions per place. [2025-03-09 01:31:04,662 INFO L140 encePairwiseOnDemand]: 38/56 looper letters, 85 selfloop transitions, 23 changer transitions 0/113 dead transitions. [2025-03-09 01:31:04,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 687 flow [2025-03-09 01:31:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:31:04,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:31:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 250 transitions. [2025-03-09 01:31:04,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580357142857143 [2025-03-09 01:31:04,664 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 312 flow. Second operand 8 states and 250 transitions. [2025-03-09 01:31:04,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 687 flow [2025-03-09 01:31:04,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 113 transitions, 665 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:04,670 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 419 flow [2025-03-09 01:31:04,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=419, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2025-03-09 01:31:04,671 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2025-03-09 01:31:04,671 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 419 flow [2025-03-09 01:31:04,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 21.11764705882353) internal successors, (359), 17 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:04,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:04,671 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:04,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:31:04,877 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-09 01:31:04,877 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:04,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:04,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1229794664, now seen corresponding path program 2 times [2025-03-09 01:31:04,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:04,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515426984] [2025-03-09 01:31:04,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:04,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:04,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-09 01:31:04,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-03-09 01:31:04,894 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:04,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:05,032 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-09 01:31:05,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:05,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515426984] [2025-03-09 01:31:05,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515426984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:05,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:05,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:31:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792830895] [2025-03-09 01:31:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:05,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:05,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:05,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:05,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 01:31:05,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:05,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 01:31:05,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:05,320 INFO L124 PetriNetUnfolderBase]: 1146/1918 cut-off events. [2025-03-09 01:31:05,321 INFO L125 PetriNetUnfolderBase]: For 2168/2168 co-relation queries the response was YES. [2025-03-09 01:31:05,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5590 conditions, 1918 events. 1146/1918 cut-off events. For 2168/2168 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9956 event pairs, 100 based on Foata normal form. 16/1876 useless extension candidates. Maximal degree in co-relation 3515. Up to 679 conditions per place. [2025-03-09 01:31:05,329 INFO L140 encePairwiseOnDemand]: 40/56 looper letters, 63 selfloop transitions, 36 changer transitions 0/104 dead transitions. [2025-03-09 01:31:05,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 745 flow [2025-03-09 01:31:05,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:31:05,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:31:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 203 transitions. [2025-03-09 01:31:05,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-03-09 01:31:05,330 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 419 flow. Second operand 7 states and 203 transitions. [2025-03-09 01:31:05,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 745 flow [2025-03-09 01:31:05,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 104 transitions, 728 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:31:05,335 INFO L231 Difference]: Finished difference. Result has 63 places, 72 transitions, 503 flow [2025-03-09 01:31:05,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=503, PETRI_PLACES=63, PETRI_TRANSITIONS=72} [2025-03-09 01:31:05,336 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-09 01:31:05,336 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 72 transitions, 503 flow [2025-03-09 01:31:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:05,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:05,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:31:05,337 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:05,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash 716125426, now seen corresponding path program 1 times [2025-03-09 01:31:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285943094] [2025-03-09 01:31:05,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:05,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:31:05,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:31:05,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:05,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:05,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-09 01:31:05,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:05,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285943094] [2025-03-09 01:31:05,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285943094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:05,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:05,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168415175] [2025-03-09 01:31:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:05,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:05,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:05,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:05,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:05,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-03-09 01:31:05,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 72 transitions, 503 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:05,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-03-09 01:31:05,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:05,505 INFO L124 PetriNetUnfolderBase]: 1126/1902 cut-off events. [2025-03-09 01:31:05,506 INFO L125 PetriNetUnfolderBase]: For 3290/3290 co-relation queries the response was YES. [2025-03-09 01:31:05,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6264 conditions, 1902 events. 1126/1902 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10042 event pairs, 269 based on Foata normal form. 2/1839 useless extension candidates. Maximal degree in co-relation 4033. Up to 1434 conditions per place. [2025-03-09 01:31:05,514 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 74 selfloop transitions, 11 changer transitions 1/91 dead transitions. [2025-03-09 01:31:05,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 770 flow [2025-03-09 01:31:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-09 01:31:05,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-09 01:31:05,515 INFO L175 Difference]: Start difference. First operand has 63 places, 72 transitions, 503 flow. Second operand 3 states and 126 transitions. [2025-03-09 01:31:05,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 770 flow [2025-03-09 01:31:05,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 91 transitions, 723 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:05,524 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 553 flow [2025-03-09 01:31:05,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2025-03-09 01:31:05,526 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-09 01:31:05,526 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 553 flow [2025-03-09 01:31:05,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:05,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:05,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:31:05,526 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1146539283, now seen corresponding path program 1 times [2025-03-09 01:31:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815912391] [2025-03-09 01:31:05,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:05,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:31:05,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:31:05,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:05,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:05,632 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-09 01:31:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815912391] [2025-03-09 01:31:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815912391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:05,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:05,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:05,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947662871] [2025-03-09 01:31:05,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:05,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:05,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:05,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:05,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:05,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-03-09 01:31:05,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 553 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:05,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-03-09 01:31:05,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:05,958 INFO L124 PetriNetUnfolderBase]: 1348/2214 cut-off events. [2025-03-09 01:31:05,958 INFO L125 PetriNetUnfolderBase]: For 3596/3596 co-relation queries the response was YES. [2025-03-09 01:31:05,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7389 conditions, 2214 events. 1348/2214 cut-off events. For 3596/3596 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11727 event pairs, 411 based on Foata normal form. 6/2216 useless extension candidates. Maximal degree in co-relation 4822. Up to 1220 conditions per place. [2025-03-09 01:31:05,969 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 160 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2025-03-09 01:31:05,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 1535 flow [2025-03-09 01:31:05,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2025-03-09 01:31:05,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6964285714285714 [2025-03-09 01:31:05,970 INFO L175 Difference]: Start difference. First operand has 63 places, 77 transitions, 553 flow. Second operand 5 states and 195 transitions. [2025-03-09 01:31:05,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 1535 flow [2025-03-09 01:31:05,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 171 transitions, 1488 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:05,982 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 605 flow [2025-03-09 01:31:05,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=605, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2025-03-09 01:31:05,982 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2025-03-09 01:31:05,982 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 605 flow [2025-03-09 01:31:05,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:05,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:05,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:31:05,983 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:05,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1539948651, now seen corresponding path program 1 times [2025-03-09 01:31:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:05,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007601657] [2025-03-09 01:31:05,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:05,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:05,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:31:05,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:31:05,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:05,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:06,049 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-09 01:31:06,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:06,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007601657] [2025-03-09 01:31:06,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007601657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:06,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:06,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:31:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315859790] [2025-03-09 01:31:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:06,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:06,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:06,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:06,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:06,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 605 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:06,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:06,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:06,182 INFO L124 PetriNetUnfolderBase]: 1064/1748 cut-off events. [2025-03-09 01:31:06,184 INFO L125 PetriNetUnfolderBase]: For 3372/3372 co-relation queries the response was YES. [2025-03-09 01:31:06,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6325 conditions, 1748 events. 1064/1748 cut-off events. For 3372/3372 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8269 event pairs, 523 based on Foata normal form. 32/1780 useless extension candidates. Maximal degree in co-relation 3930. Up to 1419 conditions per place. [2025-03-09 01:31:06,190 INFO L140 encePairwiseOnDemand]: 51/56 looper letters, 81 selfloop transitions, 12 changer transitions 0/94 dead transitions. [2025-03-09 01:31:06,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 843 flow [2025-03-09 01:31:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:06,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:06,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-03-09 01:31:06,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2025-03-09 01:31:06,192 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 605 flow. Second operand 4 states and 138 transitions. [2025-03-09 01:31:06,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 843 flow [2025-03-09 01:31:06,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 812 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:06,201 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 519 flow [2025-03-09 01:31:06,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=519, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-03-09 01:31:06,201 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2025-03-09 01:31:06,201 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 519 flow [2025-03-09 01:31:06,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:06,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:06,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:31:06,202 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash 53683641, now seen corresponding path program 2 times [2025-03-09 01:31:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:06,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477591169] [2025-03-09 01:31:06,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:06,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:31:06,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-09 01:31:06,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:06,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:06,312 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-09 01:31:06,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:06,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477591169] [2025-03-09 01:31:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477591169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:31:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038622071] [2025-03-09 01:31:06,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:06,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:06,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:06,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:06,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:06,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:06,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:06,505 INFO L124 PetriNetUnfolderBase]: 1260/2090 cut-off events. [2025-03-09 01:31:06,505 INFO L125 PetriNetUnfolderBase]: For 4540/4540 co-relation queries the response was YES. [2025-03-09 01:31:06,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7884 conditions, 2090 events. 1260/2090 cut-off events. For 4540/4540 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10841 event pairs, 345 based on Foata normal form. 32/2122 useless extension candidates. Maximal degree in co-relation 5059. Up to 1018 conditions per place. [2025-03-09 01:31:06,513 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 131 selfloop transitions, 20 changer transitions 0/152 dead transitions. [2025-03-09 01:31:06,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 152 transitions, 1361 flow [2025-03-09 01:31:06,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:31:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:31:06,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2025-03-09 01:31:06,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6517857142857143 [2025-03-09 01:31:06,515 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 519 flow. Second operand 6 states and 219 transitions. [2025-03-09 01:31:06,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 152 transitions, 1361 flow [2025-03-09 01:31:06,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 152 transitions, 1337 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:06,528 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 729 flow [2025-03-09 01:31:06,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=729, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-03-09 01:31:06,529 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 26 predicate places. [2025-03-09 01:31:06,529 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 729 flow [2025-03-09 01:31:06,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:06,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:06,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:31:06,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:06,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:06,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2078514121, now seen corresponding path program 3 times [2025-03-09 01:31:06,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:06,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385830466] [2025-03-09 01:31:06,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:06,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-03-09 01:31:06,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-03-09 01:31:06,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:31:06,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:06,601 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-09 01:31:06,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:06,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385830466] [2025-03-09 01:31:06,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385830466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:06,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:06,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:06,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429481249] [2025-03-09 01:31:06,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:06,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:06,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:06,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:06,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:06,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 729 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:06,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:06,795 INFO L124 PetriNetUnfolderBase]: 1292/2154 cut-off events. [2025-03-09 01:31:06,795 INFO L125 PetriNetUnfolderBase]: For 6445/6445 co-relation queries the response was YES. [2025-03-09 01:31:06,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 2154 events. 1292/2154 cut-off events. For 6445/6445 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10865 event pairs, 533 based on Foata normal form. 46/2200 useless extension candidates. Maximal degree in co-relation 6197. Up to 1461 conditions per place. [2025-03-09 01:31:06,806 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 98 selfloop transitions, 22 changer transitions 0/121 dead transitions. [2025-03-09 01:31:06,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 1257 flow [2025-03-09 01:31:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2025-03-09 01:31:06,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964285714285714 [2025-03-09 01:31:06,807 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 729 flow. Second operand 5 states and 167 transitions. [2025-03-09 01:31:06,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 1257 flow [2025-03-09 01:31:06,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 1225 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:06,860 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 798 flow [2025-03-09 01:31:06,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=798, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-03-09 01:31:06,860 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 31 predicate places. [2025-03-09 01:31:06,861 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 798 flow [2025-03-09 01:31:06,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:06,861 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-09 01:31:06,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:31:06,861 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:06,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1969814536, now seen corresponding path program 1 times [2025-03-09 01:31:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425558736] [2025-03-09 01:31:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:06,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:31:06,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:31:06,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:06,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:06,949 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-09 01:31:06,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:06,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425558736] [2025-03-09 01:31:06,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425558736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:06,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:06,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:31:06,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552215565] [2025-03-09 01:31:06,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:06,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:06,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:06,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:06,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:06,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 798 flow. Second operand has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:06,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:06,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:07,256 INFO L124 PetriNetUnfolderBase]: 1618/2716 cut-off events. [2025-03-09 01:31:07,256 INFO L125 PetriNetUnfolderBase]: For 9357/9357 co-relation queries the response was YES. [2025-03-09 01:31:07,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 2716 events. 1618/2716 cut-off events. For 9357/9357 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14210 event pairs, 535 based on Foata normal form. 32/2748 useless extension candidates. Maximal degree in co-relation 8959. Up to 1401 conditions per place. [2025-03-09 01:31:07,270 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 125 selfloop transitions, 26 changer transitions 0/152 dead transitions. [2025-03-09 01:31:07,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 152 transitions, 1588 flow [2025-03-09 01:31:07,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:31:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:31:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 233 transitions. [2025-03-09 01:31:07,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5943877551020408 [2025-03-09 01:31:07,271 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 798 flow. Second operand 7 states and 233 transitions. [2025-03-09 01:31:07,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 152 transitions, 1588 flow [2025-03-09 01:31:07,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 152 transitions, 1550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:07,296 INFO L231 Difference]: Finished difference. Result has 92 places, 92 transitions, 960 flow [2025-03-09 01:31:07,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=960, PETRI_PLACES=92, PETRI_TRANSITIONS=92} [2025-03-09 01:31:07,297 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2025-03-09 01:31:07,297 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 92 transitions, 960 flow [2025-03-09 01:31:07,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.5) internal successors, (153), 6 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:07,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:07,298 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-09 01:31:07,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:31:07,298 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:07,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:07,298 INFO L85 PathProgramCache]: Analyzing trace with hash 884752644, now seen corresponding path program 2 times [2025-03-09 01:31:07,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:07,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445912604] [2025-03-09 01:31:07,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:07,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:07,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:31:07,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-09 01:31:07,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:07,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:07,380 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-09 01:31:07,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:07,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445912604] [2025-03-09 01:31:07,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445912604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:07,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:07,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:07,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000635864] [2025-03-09 01:31:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:07,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:07,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:07,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:07,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:07,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 92 transitions, 960 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:07,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:07,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:07,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:07,681 INFO L124 PetriNetUnfolderBase]: 1580/2624 cut-off events. [2025-03-09 01:31:07,681 INFO L125 PetriNetUnfolderBase]: For 12228/12228 co-relation queries the response was YES. [2025-03-09 01:31:07,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11546 conditions, 2624 events. 1580/2624 cut-off events. For 12228/12228 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13671 event pairs, 505 based on Foata normal form. 6/2630 useless extension candidates. Maximal degree in co-relation 10341. Up to 1318 conditions per place. [2025-03-09 01:31:07,695 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 120 selfloop transitions, 28 changer transitions 0/149 dead transitions. [2025-03-09 01:31:07,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 149 transitions, 1676 flow [2025-03-09 01:31:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:07,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2025-03-09 01:31:07,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6535714285714286 [2025-03-09 01:31:07,696 INFO L175 Difference]: Start difference. First operand has 92 places, 92 transitions, 960 flow. Second operand 5 states and 183 transitions. [2025-03-09 01:31:07,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 149 transitions, 1676 flow [2025-03-09 01:31:07,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 149 transitions, 1626 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:07,730 INFO L231 Difference]: Finished difference. Result has 95 places, 95 transitions, 1056 flow [2025-03-09 01:31:07,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1056, PETRI_PLACES=95, PETRI_TRANSITIONS=95} [2025-03-09 01:31:07,731 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2025-03-09 01:31:07,731 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 95 transitions, 1056 flow [2025-03-09 01:31:07,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:07,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:07,731 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-09 01:31:07,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:31:07,732 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash -132731122, now seen corresponding path program 3 times [2025-03-09 01:31:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225451993] [2025-03-09 01:31:07,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:07,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:31:07,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 20 of 22 statements. [2025-03-09 01:31:07,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:31:07,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:07,806 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-09 01:31:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225451993] [2025-03-09 01:31:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225451993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:07,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371513667] [2025-03-09 01:31:07,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:07,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:07,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:07,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:07,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:07,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 95 transitions, 1056 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:07,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:07,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:07,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:08,051 INFO L124 PetriNetUnfolderBase]: 1574/2618 cut-off events. [2025-03-09 01:31:08,052 INFO L125 PetriNetUnfolderBase]: For 14078/14078 co-relation queries the response was YES. [2025-03-09 01:31:08,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11874 conditions, 2618 events. 1574/2618 cut-off events. For 14078/14078 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13356 event pairs, 751 based on Foata normal form. 6/2624 useless extension candidates. Maximal degree in co-relation 10774. Up to 2165 conditions per place. [2025-03-09 01:31:08,064 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 91 selfloop transitions, 35 changer transitions 0/127 dead transitions. [2025-03-09 01:31:08,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 127 transitions, 1615 flow [2025-03-09 01:31:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2025-03-09 01:31:08,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6035714285714285 [2025-03-09 01:31:08,065 INFO L175 Difference]: Start difference. First operand has 95 places, 95 transitions, 1056 flow. Second operand 5 states and 169 transitions. [2025-03-09 01:31:08,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 127 transitions, 1615 flow [2025-03-09 01:31:08,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 1559 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:08,093 INFO L231 Difference]: Finished difference. Result has 100 places, 107 transitions, 1334 flow [2025-03-09 01:31:08,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1334, PETRI_PLACES=100, PETRI_TRANSITIONS=107} [2025-03-09 01:31:08,094 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 46 predicate places. [2025-03-09 01:31:08,094 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 107 transitions, 1334 flow [2025-03-09 01:31:08,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:08,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:08,094 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-09 01:31:08,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:31:08,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:08,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:08,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1761255276, now seen corresponding path program 4 times [2025-03-09 01:31:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216671103] [2025-03-09 01:31:08,095 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:08,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:08,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:31:08,113 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:31:08,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:08,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:08,332 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-09 01:31:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216671103] [2025-03-09 01:31:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216671103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:08,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:08,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:31:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099375535] [2025-03-09 01:31:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:08,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:31:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:08,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:31:08,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:31:08,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:08,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 107 transitions, 1334 flow. Second operand has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:08,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:08,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:08,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:09,015 INFO L124 PetriNetUnfolderBase]: 1740/2890 cut-off events. [2025-03-09 01:31:09,015 INFO L125 PetriNetUnfolderBase]: For 16667/16667 co-relation queries the response was YES. [2025-03-09 01:31:09,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13242 conditions, 2890 events. 1740/2890 cut-off events. For 16667/16667 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15096 event pairs, 701 based on Foata normal form. 54/2944 useless extension candidates. Maximal degree in co-relation 12155. Up to 1997 conditions per place. [2025-03-09 01:31:09,029 INFO L140 encePairwiseOnDemand]: 45/56 looper letters, 140 selfloop transitions, 73 changer transitions 0/214 dead transitions. [2025-03-09 01:31:09,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 214 transitions, 2569 flow [2025-03-09 01:31:09,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 01:31:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-09 01:31:09,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 427 transitions. [2025-03-09 01:31:09,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5446428571428571 [2025-03-09 01:31:09,031 INFO L175 Difference]: Start difference. First operand has 100 places, 107 transitions, 1334 flow. Second operand 14 states and 427 transitions. [2025-03-09 01:31:09,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 214 transitions, 2569 flow [2025-03-09 01:31:09,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 214 transitions, 2512 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:09,072 INFO L231 Difference]: Finished difference. Result has 121 places, 146 transitions, 1990 flow [2025-03-09 01:31:09,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1990, PETRI_PLACES=121, PETRI_TRANSITIONS=146} [2025-03-09 01:31:09,073 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 67 predicate places. [2025-03-09 01:31:09,073 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 1990 flow [2025-03-09 01:31:09,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.333333333333332) internal successors, (219), 9 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:09,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:09,073 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:09,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:31:09,073 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:09,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:09,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1078114937, now seen corresponding path program 1 times [2025-03-09 01:31:09,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:09,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244091245] [2025-03-09 01:31:09,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:09,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:09,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:31:09,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:31:09,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:09,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:09,317 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-09 01:31:09,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:09,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244091245] [2025-03-09 01:31:09,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244091245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:09,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:09,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:31:09,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279860755] [2025-03-09 01:31:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:09,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:31:09,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:09,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:31:09,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:31:09,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:09,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 1990 flow. Second operand has 9 states, 9 states have (on average 24.555555555555557) internal successors, (221), 9 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:09,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:09,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:09,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:10,139 INFO L124 PetriNetUnfolderBase]: 2772/4661 cut-off events. [2025-03-09 01:31:10,139 INFO L125 PetriNetUnfolderBase]: For 30623/30623 co-relation queries the response was YES. [2025-03-09 01:31:10,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23387 conditions, 4661 events. 2772/4661 cut-off events. For 30623/30623 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 27590 event pairs, 768 based on Foata normal form. 44/4705 useless extension candidates. Maximal degree in co-relation 21362. Up to 1544 conditions per place. [2025-03-09 01:31:10,168 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 275 selfloop transitions, 83 changer transitions 0/359 dead transitions. [2025-03-09 01:31:10,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 359 transitions, 4664 flow [2025-03-09 01:31:10,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:31:10,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:31:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 398 transitions. [2025-03-09 01:31:10,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6461038961038961 [2025-03-09 01:31:10,173 INFO L175 Difference]: Start difference. First operand has 121 places, 146 transitions, 1990 flow. Second operand 11 states and 398 transitions. [2025-03-09 01:31:10,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 359 transitions, 4664 flow [2025-03-09 01:31:10,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 359 transitions, 4530 flow, removed 43 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:10,301 INFO L231 Difference]: Finished difference. Result has 138 places, 193 transitions, 2932 flow [2025-03-09 01:31:10,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2932, PETRI_PLACES=138, PETRI_TRANSITIONS=193} [2025-03-09 01:31:10,302 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 84 predicate places. [2025-03-09 01:31:10,302 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 193 transitions, 2932 flow [2025-03-09 01:31:10,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.555555555555557) internal successors, (221), 9 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:10,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:10,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, 1] [2025-03-09 01:31:10,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:31:10,302 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:10,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:10,302 INFO L85 PathProgramCache]: Analyzing trace with hash -783190931, now seen corresponding path program 2 times [2025-03-09 01:31:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:10,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472133685] [2025-03-09 01:31:10,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:10,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:10,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-09 01:31:10,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 24 statements. [2025-03-09 01:31:10,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:10,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:10,421 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-09 01:31:10,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:10,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472133685] [2025-03-09 01:31:10,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472133685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:10,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:10,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:31:10,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167748080] [2025-03-09 01:31:10,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:10,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:31:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:10,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:31:10,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:31:10,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:10,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 193 transitions, 2932 flow. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:10,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:10,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:10,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:11,009 INFO L124 PetriNetUnfolderBase]: 2694/4575 cut-off events. [2025-03-09 01:31:11,009 INFO L125 PetriNetUnfolderBase]: For 41211/41211 co-relation queries the response was YES. [2025-03-09 01:31:11,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25671 conditions, 4575 events. 2694/4575 cut-off events. For 41211/41211 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 26974 event pairs, 969 based on Foata normal form. 70/4645 useless extension candidates. Maximal degree in co-relation 24626. Up to 2462 conditions per place. [2025-03-09 01:31:11,036 INFO L140 encePairwiseOnDemand]: 47/56 looper letters, 196 selfloop transitions, 80 changer transitions 0/277 dead transitions. [2025-03-09 01:31:11,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 277 transitions, 4503 flow [2025-03-09 01:31:11,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:31:11,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:31:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2025-03-09 01:31:11,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5790816326530612 [2025-03-09 01:31:11,037 INFO L175 Difference]: Start difference. First operand has 138 places, 193 transitions, 2932 flow. Second operand 7 states and 227 transitions. [2025-03-09 01:31:11,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 277 transitions, 4503 flow [2025-03-09 01:31:11,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 277 transitions, 4327 flow, removed 88 selfloop flow, removed 0 redundant places. [2025-03-09 01:31:11,138 INFO L231 Difference]: Finished difference. Result has 147 places, 199 transitions, 3171 flow [2025-03-09 01:31:11,138 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=2848, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3171, PETRI_PLACES=147, PETRI_TRANSITIONS=199} [2025-03-09 01:31:11,138 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 93 predicate places. [2025-03-09 01:31:11,139 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 199 transitions, 3171 flow [2025-03-09 01:31:11,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:11,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:11,139 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:11,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:31:11,139 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:11,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:11,139 INFO L85 PathProgramCache]: Analyzing trace with hash 856680437, now seen corresponding path program 1 times [2025-03-09 01:31:11,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:11,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613902249] [2025-03-09 01:31:11,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:11,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:11,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:31:11,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:11,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:11,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:11,236 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-09 01:31:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613902249] [2025-03-09 01:31:11,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613902249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:11,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:31:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279272426] [2025-03-09 01:31:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:11,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:31:11,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:11,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:31:11,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:31:11,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 56 [2025-03-09 01:31:11,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 199 transitions, 3171 flow. Second operand has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:11,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:11,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 56 [2025-03-09 01:31:11,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:12,078 INFO L124 PetriNetUnfolderBase]: 2754/4779 cut-off events. [2025-03-09 01:31:12,078 INFO L125 PetriNetUnfolderBase]: For 44235/44251 co-relation queries the response was YES. [2025-03-09 01:31:12,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26881 conditions, 4779 events. 2754/4779 cut-off events. For 44235/44251 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 29899 event pairs, 659 based on Foata normal form. 26/4805 useless extension candidates. Maximal degree in co-relation 25095. Up to 1482 conditions per place. [2025-03-09 01:31:12,109 INFO L140 encePairwiseOnDemand]: 44/56 looper letters, 327 selfloop transitions, 88 changer transitions 0/417 dead transitions. [2025-03-09 01:31:12,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 417 transitions, 6002 flow [2025-03-09 01:31:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:31:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:31:12,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 436 transitions. [2025-03-09 01:31:12,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2025-03-09 01:31:12,111 INFO L175 Difference]: Start difference. First operand has 147 places, 199 transitions, 3171 flow. Second operand 12 states and 436 transitions. [2025-03-09 01:31:12,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 417 transitions, 6002 flow [2025-03-09 01:31:12,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 417 transitions, 5824 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:12,240 INFO L231 Difference]: Finished difference. Result has 162 places, 224 transitions, 3683 flow [2025-03-09 01:31:12,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3050, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3683, PETRI_PLACES=162, PETRI_TRANSITIONS=224} [2025-03-09 01:31:12,240 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 108 predicate places. [2025-03-09 01:31:12,240 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 224 transitions, 3683 flow [2025-03-09 01:31:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.0) internal successors, (208), 8 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:12,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:12,241 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:12,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:31:12,241 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:12,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:12,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1509114741, now seen corresponding path program 2 times [2025-03-09 01:31:12,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:12,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336333861] [2025-03-09 01:31:12,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:12,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:12,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:31:12,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:12,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:12,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:12,399 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-09 01:31:12,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336333861] [2025-03-09 01:31:12,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336333861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:12,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498317733] [2025-03-09 01:31:12,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:12,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:12,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:12,402 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:12,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:31:12,441 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:31:12,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:12,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:12,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:12,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 01:31:12,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:12,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:31:12,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:31:12,612 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-09 01:31:12,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:12,831 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 33 treesize of output 29 [2025-03-09 01:31:12,849 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:31:12,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-09 01:31:12,897 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-09 01:31:12,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498317733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:12,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:12,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-09 01:31:12,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160713717] [2025-03-09 01:31:12,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:12,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:31:12,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:12,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:31:12,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:31:13,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:13,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 224 transitions, 3683 flow. Second operand has 18 states, 18 states have (on average 25.833333333333332) internal successors, (465), 18 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:13,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:13,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:13,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:15,238 INFO L124 PetriNetUnfolderBase]: 3465/5916 cut-off events. [2025-03-09 01:31:15,238 INFO L125 PetriNetUnfolderBase]: For 60427/60427 co-relation queries the response was YES. [2025-03-09 01:31:15,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34817 conditions, 5916 events. 3465/5916 cut-off events. For 60427/60427 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 36118 event pairs, 394 based on Foata normal form. 23/5939 useless extension candidates. Maximal degree in co-relation 33672. Up to 1027 conditions per place. [2025-03-09 01:31:15,274 INFO L140 encePairwiseOnDemand]: 36/56 looper letters, 262 selfloop transitions, 133 changer transitions 243/639 dead transitions. [2025-03-09 01:31:15,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 639 transitions, 8926 flow [2025-03-09 01:31:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 01:31:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-09 01:31:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1123 transitions. [2025-03-09 01:31:15,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076839826839827 [2025-03-09 01:31:15,276 INFO L175 Difference]: Start difference. First operand has 162 places, 224 transitions, 3683 flow. Second operand 33 states and 1123 transitions. [2025-03-09 01:31:15,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 639 transitions, 8926 flow [2025-03-09 01:31:15,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 639 transitions, 8807 flow, removed 36 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:15,450 INFO L231 Difference]: Finished difference. Result has 204 places, 218 transitions, 3584 flow [2025-03-09 01:31:15,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3543, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3584, PETRI_PLACES=204, PETRI_TRANSITIONS=218} [2025-03-09 01:31:15,450 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 150 predicate places. [2025-03-09 01:31:15,450 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 218 transitions, 3584 flow [2025-03-09 01:31:15,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 25.833333333333332) internal successors, (465), 18 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:15,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:15,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:15,456 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-09 01:31:15,651 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,SelfDestructingSolverStorable25 [2025-03-09 01:31:15,651 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:15,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1573247713, now seen corresponding path program 3 times [2025-03-09 01:31:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:15,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687568892] [2025-03-09 01:31:15,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:15,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:31:15,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-03-09 01:31:15,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:31:15,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:15,752 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-09 01:31:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:15,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687568892] [2025-03-09 01:31:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687568892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:15,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:31:15,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382203270] [2025-03-09 01:31:15,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:31:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:31:15,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:31:15,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:15,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 218 transitions, 3584 flow. Second operand has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:15,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:15,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:15,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:16,543 INFO L124 PetriNetUnfolderBase]: 2149/3766 cut-off events. [2025-03-09 01:31:16,543 INFO L125 PetriNetUnfolderBase]: For 43215/43215 co-relation queries the response was YES. [2025-03-09 01:31:16,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23208 conditions, 3766 events. 2149/3766 cut-off events. For 43215/43215 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 21330 event pairs, 948 based on Foata normal form. 28/3794 useless extension candidates. Maximal degree in co-relation 23040. Up to 2561 conditions per place. [2025-03-09 01:31:16,580 INFO L140 encePairwiseOnDemand]: 46/56 looper letters, 262 selfloop transitions, 60 changer transitions 0/323 dead transitions. [2025-03-09 01:31:16,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 323 transitions, 5400 flow [2025-03-09 01:31:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:31:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:31:16,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 314 transitions. [2025-03-09 01:31:16,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2025-03-09 01:31:16,581 INFO L175 Difference]: Start difference. First operand has 204 places, 218 transitions, 3584 flow. Second operand 9 states and 314 transitions. [2025-03-09 01:31:16,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 323 transitions, 5400 flow [2025-03-09 01:31:16,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 323 transitions, 4945 flow, removed 180 selfloop flow, removed 17 redundant places. [2025-03-09 01:31:16,766 INFO L231 Difference]: Finished difference. Result has 186 places, 223 transitions, 3412 flow [2025-03-09 01:31:16,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3412, PETRI_PLACES=186, PETRI_TRANSITIONS=223} [2025-03-09 01:31:16,766 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 132 predicate places. [2025-03-09 01:31:16,766 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 223 transitions, 3412 flow [2025-03-09 01:31:16,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.0) internal successors, (200), 8 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:16,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:16,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:16,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:31:16,767 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:16,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 112712003, now seen corresponding path program 4 times [2025-03-09 01:31:16,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:16,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445498787] [2025-03-09 01:31:16,767 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:16,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:16,771 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:31:16,775 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:16,775 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:16,912 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-09 01:31:16,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445498787] [2025-03-09 01:31:16,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445498787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:16,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351791820] [2025-03-09 01:31:16,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:16,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:16,915 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:16,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:31:16,954 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:31:16,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:16,971 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:16,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:16,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 01:31:16,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:16,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:31:17,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 01:31:17,095 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-09 01:31:17,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:17,286 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 33 treesize of output 29 [2025-03-09 01:31:17,295 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-09 01:31:17,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2025-03-09 01:31:17,358 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-09 01:31:17,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351791820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:17,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:17,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-03-09 01:31:17,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667157250] [2025-03-09 01:31:17,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:17,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:31:17,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:17,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:31:17,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:31:17,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 56 [2025-03-09 01:31:17,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 223 transitions, 3412 flow. Second operand has 18 states, 18 states have (on average 29.11111111111111) internal successors, (524), 18 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:17,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:17,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 56 [2025-03-09 01:31:17,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:18,455 INFO L124 PetriNetUnfolderBase]: 2297/4157 cut-off events. [2025-03-09 01:31:18,455 INFO L125 PetriNetUnfolderBase]: For 41439/41463 co-relation queries the response was YES. [2025-03-09 01:31:18,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24075 conditions, 4157 events. 2297/4157 cut-off events. For 41439/41463 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 25387 event pairs, 523 based on Foata normal form. 4/4114 useless extension candidates. Maximal degree in co-relation 23673. Up to 2569 conditions per place. [2025-03-09 01:31:18,487 INFO L140 encePairwiseOnDemand]: 41/56 looper letters, 172 selfloop transitions, 65 changer transitions 78/334 dead transitions. [2025-03-09 01:31:18,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 334 transitions, 5239 flow [2025-03-09 01:31:18,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:31:18,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:31:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 456 transitions. [2025-03-09 01:31:18,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6263736263736264 [2025-03-09 01:31:18,488 INFO L175 Difference]: Start difference. First operand has 186 places, 223 transitions, 3412 flow. Second operand 13 states and 456 transitions. [2025-03-09 01:31:18,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 334 transitions, 5239 flow [2025-03-09 01:31:18,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 334 transitions, 5104 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-09 01:31:18,631 INFO L231 Difference]: Finished difference. Result has 196 places, 216 transitions, 3299 flow [2025-03-09 01:31:18,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3321, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3299, PETRI_PLACES=196, PETRI_TRANSITIONS=216} [2025-03-09 01:31:18,631 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 142 predicate places. [2025-03-09 01:31:18,631 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 216 transitions, 3299 flow [2025-03-09 01:31:18,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.11111111111111) internal successors, (524), 18 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:18,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:18,632 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, 1, 1] [2025-03-09 01:31:18,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:31:18,832 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,SelfDestructingSolverStorable27 [2025-03-09 01:31:18,832 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:18,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:18,832 INFO L85 PathProgramCache]: Analyzing trace with hash -971040493, now seen corresponding path program 5 times [2025-03-09 01:31:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:18,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115552729] [2025-03-09 01:31:18,833 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:31:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:18,838 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-09 01:31:18,844 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:31:18,844 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-09 01:31:18,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:18,995 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-09 01:31:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115552729] [2025-03-09 01:31:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115552729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:18,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:18,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:31:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213946714] [2025-03-09 01:31:18,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:18,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:31:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:18,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:31:18,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:31:19,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:19,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 216 transitions, 3299 flow. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:19,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:19,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:19,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:19,600 INFO L124 PetriNetUnfolderBase]: 2404/4084 cut-off events. [2025-03-09 01:31:19,600 INFO L125 PetriNetUnfolderBase]: For 40403/40403 co-relation queries the response was YES. [2025-03-09 01:31:19,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24092 conditions, 4084 events. 2404/4084 cut-off events. For 40403/40403 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 22666 event pairs, 1220 based on Foata normal form. 24/4108 useless extension candidates. Maximal degree in co-relation 24019. Up to 3105 conditions per place. [2025-03-09 01:31:19,626 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 226 selfloop transitions, 57 changer transitions 0/284 dead transitions. [2025-03-09 01:31:19,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 284 transitions, 4511 flow [2025-03-09 01:31:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:31:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:31:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2025-03-09 01:31:19,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6026785714285714 [2025-03-09 01:31:19,627 INFO L175 Difference]: Start difference. First operand has 196 places, 216 transitions, 3299 flow. Second operand 8 states and 270 transitions. [2025-03-09 01:31:19,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 284 transitions, 4511 flow [2025-03-09 01:31:19,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 284 transitions, 4258 flow, removed 97 selfloop flow, removed 10 redundant places. [2025-03-09 01:31:19,731 INFO L231 Difference]: Finished difference. Result has 179 places, 222 transitions, 3361 flow [2025-03-09 01:31:19,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3361, PETRI_PLACES=179, PETRI_TRANSITIONS=222} [2025-03-09 01:31:19,732 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 125 predicate places. [2025-03-09 01:31:19,732 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 222 transitions, 3361 flow [2025-03-09 01:31:19,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:19,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:19,732 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, 1, 1] [2025-03-09 01:31:19,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 01:31:19,733 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:31:19,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash 183805209, now seen corresponding path program 1 times [2025-03-09 01:31:19,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:19,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092580299] [2025-03-09 01:31:19,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:19,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:31:19,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:31:19,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:19,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:19,933 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-09 01:31:19,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:19,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092580299] [2025-03-09 01:31:19,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092580299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:19,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68446674] [2025-03-09 01:31:19,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:19,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:19,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:19,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:19,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:31:19,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 01:31:20,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:31:20,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:20,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:20,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:31:20,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:20,178 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-09 01:31:20,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:20,378 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-09 01:31:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68446674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:20,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:20,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-03-09 01:31:20,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645406384] [2025-03-09 01:31:20,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:20,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:31:20,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:20,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:31:20,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:31:20,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:31:20,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 222 transitions, 3361 flow. Second operand has 24 states, 24 states have (on average 23.833333333333332) internal successors, (572), 24 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:20,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:20,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:31:20,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:46,065 WARN L286 SmtUtils]: Spent 24.06s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-09 01:31:56,976 WARN L286 SmtUtils]: Spent 10.09s on a formula simplification. DAG size of input: 31 DAG size of output: 25 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-09 01:32:06,495 WARN L286 SmtUtils]: Spent 9.37s on a formula simplification. DAG size of input: 33 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-09 01:32:19,605 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 38 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-09 01:32:26,660 INFO L124 PetriNetUnfolderBase]: 3608/6222 cut-off events. [2025-03-09 01:32:26,660 INFO L125 PetriNetUnfolderBase]: For 62757/62757 co-relation queries the response was YES. [2025-03-09 01:32:26,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34519 conditions, 6222 events. 3608/6222 cut-off events. For 62757/62757 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 38963 event pairs, 607 based on Foata normal form. 95/6317 useless extension candidates. Maximal degree in co-relation 34449. Up to 1583 conditions per place. [2025-03-09 01:32:26,706 INFO L140 encePairwiseOnDemand]: 37/56 looper letters, 541 selfloop transitions, 325 changer transitions 0/867 dead transitions. [2025-03-09 01:32:26,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 867 transitions, 11058 flow [2025-03-09 01:32:26,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-09 01:32:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2025-03-09 01:32:26,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 2003 transitions. [2025-03-09 01:32:26,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5419372294372294 [2025-03-09 01:32:26,709 INFO L175 Difference]: Start difference. First operand has 179 places, 222 transitions, 3361 flow. Second operand 66 states and 2003 transitions. [2025-03-09 01:32:26,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 867 transitions, 11058 flow [2025-03-09 01:32:26,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 867 transitions, 10915 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-09 01:32:26,887 INFO L231 Difference]: Finished difference. Result has 273 places, 495 transitions, 8035 flow [2025-03-09 01:32:26,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=3237, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=8035, PETRI_PLACES=273, PETRI_TRANSITIONS=495} [2025-03-09 01:32:26,888 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 219 predicate places. [2025-03-09 01:32:26,888 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 495 transitions, 8035 flow [2025-03-09 01:32:26,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 23.833333333333332) internal successors, (572), 24 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:26,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:26,888 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, 1, 1] [2025-03-09 01:32:26,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:32:27,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:27,090 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2025-03-09 01:32:27,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:27,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1395104985, now seen corresponding path program 2 times [2025-03-09 01:32:27,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:27,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922543471] [2025-03-09 01:32:27,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:32:27,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:27,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:32:27,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:32:27,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:32:27,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:27,486 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-09 01:32:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922543471] [2025-03-09 01:32:27,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922543471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:27,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520285138] [2025-03-09 01:32:27,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:32:27,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:27,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:27,488 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:27,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:32:27,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-09 01:32:27,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 01:32:27,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:32:27,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:27,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:32:27,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:27,697 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-09 01:32:27,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:27,829 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-09 01:32:27,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520285138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:32:27,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:32:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 24 [2025-03-09 01:32:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508536199] [2025-03-09 01:32:27,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:32:27,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-09 01:32:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:27,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-09 01:32:27,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2025-03-09 01:32:27,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 01:32:27,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 495 transitions, 8035 flow. Second operand has 24 states, 24 states have (on average 23.958333333333332) internal successors, (575), 24 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:27,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:27,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 01:32:27,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand