./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:14:14,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:14:14,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:14:14,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:14:14,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:14:14,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:14:14,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:14:14,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:14:14,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:14:14,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:14:14,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:14:14,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:14:14,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:14:14,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:14:14,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:14:14,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:14:14,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:14:14,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:14:14,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:14:14,887 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-03-04 10:14:15,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:14:15,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:14:15,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:14:15,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:14:15,118 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:14:15,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-04 10:14:16,220 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1d7aa6a/51a01f4f231644909267c8f829ea6491/FLAGbc4b018ed [2025-03-04 10:14:16,469 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:14:16,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-04 10:14:16,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1d7aa6a/51a01f4f231644909267c8f829ea6491/FLAGbc4b018ed [2025-03-04 10:14:16,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db1d7aa6a/51a01f4f231644909267c8f829ea6491 [2025-03-04 10:14:16,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:14:16,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:14:16,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:14:16,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:14:16,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:14:16,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16, skipping insertion in model container [2025-03-04 10:14:16,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:16,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:14:16,935 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:14:16,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:14:16,948 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:14:16,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:14:16,989 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:14:16,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16 WrapperNode [2025-03-04 10:14:16,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:14:16,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:14:16,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:14:16,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:14:16,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,019 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2025-03-04 10:14:17,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:14:17,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:14:17,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:14:17,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:14:17,028 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,051 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 10:14:17,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,059 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:14:17,064 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:14:17,064 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:14:17,064 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:14:17,064 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (1/1) ... [2025-03-04 10:14:17,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:14:17,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:17,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:14:17,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:14:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:14:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:14:17,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:14:17,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:14:17,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:14:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:14:17,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:14:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:14:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:14:17,123 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:14:17,208 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:14:17,209 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:14:17,477 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:14:17,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:14:17,608 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:14:17,611 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:14:17,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:14:17 BoogieIcfgContainer [2025-03-04 10:14:17,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:14:17,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:14:17,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:14:17,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:14:17,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:14:16" (1/3) ... [2025-03-04 10:14:17,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d1921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:14:17, skipping insertion in model container [2025-03-04 10:14:17,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:14:16" (2/3) ... [2025-03-04 10:14:17,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d1921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:14:17, skipping insertion in model container [2025-03-04 10:14:17,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:14:17" (3/3) ... [2025-03-04 10:14:17,620 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-03-04 10:14:17,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:14:17,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 53 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-03-04 10:14:17,637 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:14:17,724 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:14:17,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 59 transitions, 139 flow [2025-03-04 10:14:17,781 INFO L124 PetriNetUnfolderBase]: 7/56 cut-off events. [2025-03-04 10:14:17,784 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:14:17,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 7/56 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-03-04 10:14:17,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 59 transitions, 139 flow [2025-03-04 10:14:17,802 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 55 transitions, 128 flow [2025-03-04 10:14:17,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:14:17,819 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;@5eb896b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:14:17,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-03-04 10:14:17,823 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:14:17,824 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:14:17,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:14:17,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:17,824 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:14:17,826 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:17,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:17,830 INFO L85 PathProgramCache]: Analyzing trace with hash 395052, now seen corresponding path program 1 times [2025-03-04 10:14:17,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:17,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675120586] [2025-03-04 10:14:17,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:17,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:17,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:14:17,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:14:17,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:17,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675120586] [2025-03-04 10:14:18,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675120586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:18,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:18,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:14:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283190466] [2025-03-04 10:14:18,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:18,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:14:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:18,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:14:18,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:14:18,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-04 10:14:18,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:18,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-04 10:14:18,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:18,391 INFO L124 PetriNetUnfolderBase]: 801/1520 cut-off events. [2025-03-04 10:14:18,391 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-04 10:14:18,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 1520 events. 801/1520 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8924 event pairs, 478 based on Foata normal form. 1/1082 useless extension candidates. Maximal degree in co-relation 2454. Up to 1082 conditions per place. [2025-03-04 10:14:18,408 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2025-03-04 10:14:18,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 180 flow [2025-03-04 10:14:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2025-03-04 10:14:18,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.632768361581921 [2025-03-04 10:14:18,424 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 128 flow. Second operand 3 states and 112 transitions. [2025-03-04 10:14:18,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 180 flow [2025-03-04 10:14:18,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:14:18,432 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 114 flow [2025-03-04 10:14:18,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2025-03-04 10:14:18,438 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2025-03-04 10:14:18,440 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 114 flow [2025-03-04 10:14:18,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:18,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:14:18,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:14:18,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:18,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:18,441 INFO L85 PathProgramCache]: Analyzing trace with hash 395053, now seen corresponding path program 1 times [2025-03-04 10:14:18,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:18,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995238429] [2025-03-04 10:14:18,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:18,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:18,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:14:18,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:14:18,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:18,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995238429] [2025-03-04 10:14:18,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995238429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:18,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:18,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:18,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107591155] [2025-03-04 10:14:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:18,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:18,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:18,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:18,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:18,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-04 10:14:18,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:18,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-04 10:14:18,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:18,956 INFO L124 PetriNetUnfolderBase]: 802/1523 cut-off events. [2025-03-04 10:14:18,956 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 10:14:18,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2642 conditions, 1523 events. 802/1523 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8977 event pairs, 478 based on Foata normal form. 0/1084 useless extension candidates. Maximal degree in co-relation 2620. Up to 1087 conditions per place. [2025-03-04 10:14:18,964 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 29 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-03-04 10:14:18,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 188 flow [2025-03-04 10:14:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-03-04 10:14:18,965 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2025-03-04 10:14:18,965 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 114 flow. Second operand 4 states and 142 transitions. [2025-03-04 10:14:18,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 188 flow [2025-03-04 10:14:18,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:18,967 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 137 flow [2025-03-04 10:14:18,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2025-03-04 10:14:18,968 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2025-03-04 10:14:18,968 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 137 flow [2025-03-04 10:14:18,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:18,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:18,969 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:14:18,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:14:18,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:18,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash 379658508, now seen corresponding path program 1 times [2025-03-04 10:14:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:18,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462289843] [2025-03-04 10:14:18,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:18,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:14:18,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:14:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:18,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:19,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:19,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462289843] [2025-03-04 10:14:19,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462289843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:19,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915500156] [2025-03-04 10:14:19,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:19,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:19,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:19,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:19,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:14:19,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:14:19,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:14:19,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:19,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:19,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:14:19,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:19,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:14:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:19,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915500156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:19,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:19,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:14:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027981093] [2025-03-04 10:14:19,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:19,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:14:19,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:19,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:14:19,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:14:19,802 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-04 10:14:19,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 137 flow. Second operand has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:19,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:19,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-04 10:14:19,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:20,141 INFO L124 PetriNetUnfolderBase]: 802/1522 cut-off events. [2025-03-04 10:14:20,141 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 10:14:20,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 1522 events. 802/1522 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 8939 event pairs, 478 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 2627. Up to 1083 conditions per place. [2025-03-04 10:14:20,150 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 25 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2025-03-04 10:14:20,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 197 flow [2025-03-04 10:14:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-03-04 10:14:20,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5508474576271186 [2025-03-04 10:14:20,152 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 137 flow. Second operand 6 states and 195 transitions. [2025-03-04 10:14:20,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 197 flow [2025-03-04 10:14:20,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:14:20,153 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 144 flow [2025-03-04 10:14:20,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2025-03-04 10:14:20,154 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2025-03-04 10:14:20,154 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 144 flow [2025-03-04 10:14:20,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.363636363636363) internal successors, (312), 11 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:20,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:20,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:20,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:14:20,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:20,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:20,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash -131012365, now seen corresponding path program 1 times [2025-03-04 10:14:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:20,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568479254] [2025-03-04 10:14:20,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:20,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:20,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:14:20,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:14:20,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:20,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:20,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568479254] [2025-03-04 10:14:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568479254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:20,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664412834] [2025-03-04 10:14:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:20,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:20,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:20,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:20,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2025-03-04 10:14:20,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:20,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:20,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2025-03-04 10:14:20,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:20,664 INFO L124 PetriNetUnfolderBase]: 1371/2153 cut-off events. [2025-03-04 10:14:20,664 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 10:14:20,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4074 conditions, 2153 events. 1371/2153 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10462 event pairs, 893 based on Foata normal form. 0/1809 useless extension candidates. Maximal degree in co-relation 4048. Up to 1859 conditions per place. [2025-03-04 10:14:20,677 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 32 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-03-04 10:14:20,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 202 flow [2025-03-04 10:14:20,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:14:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:14:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2025-03-04 10:14:20,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4661016949152542 [2025-03-04 10:14:20,681 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 144 flow. Second operand 4 states and 110 transitions. [2025-03-04 10:14:20,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 202 flow [2025-03-04 10:14:20,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 172 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:20,682 INFO L231 Difference]: Finished difference. Result has 47 places, 48 transitions, 108 flow [2025-03-04 10:14:20,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=47, PETRI_TRANSITIONS=48} [2025-03-04 10:14:20,683 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2025-03-04 10:14:20,683 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 48 transitions, 108 flow [2025-03-04 10:14:20,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:20,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:20,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:20,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:14:20,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:20,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:20,684 INFO L85 PathProgramCache]: Analyzing trace with hash -131012364, now seen corresponding path program 1 times [2025-03-04 10:14:20,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:20,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070738625] [2025-03-04 10:14:20,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:20,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:20,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:14:20,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:14:20,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:20,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:14:20,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:20,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070738625] [2025-03-04 10:14:20,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070738625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:20,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:20,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:14:20,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758936094] [2025-03-04 10:14:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:20,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:14:20,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:20,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:14:20,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:14:20,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:20,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:20,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:20,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:20,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:20,876 INFO L124 PetriNetUnfolderBase]: 801/1397 cut-off events. [2025-03-04 10:14:20,877 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 10:14:20,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1397 events. 801/1397 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7303 event pairs, 478 based on Foata normal form. 1/1084 useless extension candidates. Maximal degree in co-relation 2496. Up to 1085 conditions per place. [2025-03-04 10:14:20,882 INFO L140 encePairwiseOnDemand]: 56/59 looper letters, 29 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-03-04 10:14:20,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 166 flow [2025-03-04 10:14:20,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2025-03-04 10:14:20,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.655367231638418 [2025-03-04 10:14:20,884 INFO L175 Difference]: Start difference. First operand has 47 places, 48 transitions, 108 flow. Second operand 3 states and 116 transitions. [2025-03-04 10:14:20,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 166 flow [2025-03-04 10:14:20,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:20,885 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 105 flow [2025-03-04 10:14:20,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-03-04 10:14:20,886 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2025-03-04 10:14:20,886 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 105 flow [2025-03-04 10:14:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:20,886 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:20,886 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:20,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:14:20,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:20,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:20,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1243743405, now seen corresponding path program 1 times [2025-03-04 10:14:20,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:20,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429515059] [2025-03-04 10:14:20,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:20,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:20,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:14:20,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:14:20,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:20,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429515059] [2025-03-04 10:14:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429515059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330069836] [2025-03-04 10:14:20,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:20,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:20,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:20,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:20,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:14:21,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:14:21,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:14:21,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:21,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:21,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:14:21,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:21,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:21,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330069836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:21,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:21,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:14:21,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245216457] [2025-03-04 10:14:21,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:21,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:14:21,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:21,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:14:21,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:14:21,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:21,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 105 flow. Second operand has 12 states, 12 states have (on average 29.583333333333332) internal successors, (355), 12 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:21,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:21,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:21,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:21,311 INFO L124 PetriNetUnfolderBase]: 1258/2172 cut-off events. [2025-03-04 10:14:21,311 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 10:14:21,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3961 conditions, 2172 events. 1258/2172 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12177 event pairs, 664 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 3950. Up to 1084 conditions per place. [2025-03-04 10:14:21,319 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 63 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2025-03-04 10:14:21,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 336 flow [2025-03-04 10:14:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-03-04 10:14:21,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.648910411622276 [2025-03-04 10:14:21,321 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 105 flow. Second operand 7 states and 268 transitions. [2025-03-04 10:14:21,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 336 flow [2025-03-04 10:14:21,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:21,322 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 150 flow [2025-03-04 10:14:21,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-03-04 10:14:21,323 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-04 10:14:21,323 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 150 flow [2025-03-04 10:14:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.583333333333332) internal successors, (355), 12 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:21,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:21,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:21,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:21,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:14:21,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:21,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:21,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1545596731, now seen corresponding path program 1 times [2025-03-04 10:14:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:21,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130403595] [2025-03-04 10:14:21,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:21,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:14:21,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:14:21,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:21,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:21,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:21,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130403595] [2025-03-04 10:14:21,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130403595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:21,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145210231] [2025-03-04 10:14:21,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:21,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:21,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:21,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:21,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:14:21,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:14:21,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:14:21,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:21,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:21,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:14:21,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:21,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:21,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145210231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:21,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:21,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:14:21,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330450690] [2025-03-04 10:14:21,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:21,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:14:21,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:21,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:14:21,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:14:21,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:21,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 150 flow. Second operand has 13 states, 13 states have (on average 29.846153846153847) internal successors, (388), 13 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:21,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:21,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:21,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:22,078 INFO L124 PetriNetUnfolderBase]: 1023/1811 cut-off events. [2025-03-04 10:14:22,078 INFO L125 PetriNetUnfolderBase]: For 322/322 co-relation queries the response was YES. [2025-03-04 10:14:22,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 1811 events. 1023/1811 cut-off events. For 322/322 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10023 event pairs, 578 based on Foata normal form. 0/1442 useless extension candidates. Maximal degree in co-relation 2649. Up to 1081 conditions per place. [2025-03-04 10:14:22,088 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 56 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2025-03-04 10:14:22,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 350 flow [2025-03-04 10:14:22,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 261 transitions. [2025-03-04 10:14:22,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6319612590799032 [2025-03-04 10:14:22,089 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 150 flow. Second operand 7 states and 261 transitions. [2025-03-04 10:14:22,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 350 flow [2025-03-04 10:14:22,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:14:22,092 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 179 flow [2025-03-04 10:14:22,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2025-03-04 10:14:22,093 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-03-04 10:14:22,093 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 179 flow [2025-03-04 10:14:22,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 29.846153846153847) internal successors, (388), 13 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:22,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:22,094 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:22,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:14:22,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:22,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:22,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1131417102, now seen corresponding path program 2 times [2025-03-04 10:14:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843899024] [2025-03-04 10:14:22,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:22,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:14:22,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 11 statements. [2025-03-04 10:14:22,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:14:22,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:14:22,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:22,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843899024] [2025-03-04 10:14:22,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843899024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:22,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:22,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:14:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369401743] [2025-03-04 10:14:22,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:22,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:14:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:22,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:14:22,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:14:22,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:14:22,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:22,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:22,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:14:22,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:22,804 INFO L124 PetriNetUnfolderBase]: 1747/2981 cut-off events. [2025-03-04 10:14:22,805 INFO L125 PetriNetUnfolderBase]: For 642/642 co-relation queries the response was YES. [2025-03-04 10:14:22,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6295 conditions, 2981 events. 1747/2981 cut-off events. For 642/642 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 17234 event pairs, 691 based on Foata normal form. 62/2387 useless extension candidates. Maximal degree in co-relation 5197. Up to 1747 conditions per place. [2025-03-04 10:14:22,816 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 67 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2025-03-04 10:14:22,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 431 flow [2025-03-04 10:14:22,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:22,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 223 transitions. [2025-03-04 10:14:22,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6299435028248588 [2025-03-04 10:14:22,818 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 179 flow. Second operand 6 states and 223 transitions. [2025-03-04 10:14:22,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 431 flow [2025-03-04 10:14:22,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 420 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:22,820 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 213 flow [2025-03-04 10:14:22,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=213, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2025-03-04 10:14:22,821 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-03-04 10:14:22,821 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 213 flow [2025-03-04 10:14:22,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:22,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:22,821 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:22,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:14:22,822 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash -974201948, now seen corresponding path program 2 times [2025-03-04 10:14:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801119211] [2025-03-04 10:14:22,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:22,827 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 10:14:22,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-04 10:14:22,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:14:22,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:14:22,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:22,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801119211] [2025-03-04 10:14:22,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801119211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:22,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:22,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:14:22,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714489728] [2025-03-04 10:14:22,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:22,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:14:22,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:22,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:14:22,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:14:23,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:14:23,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:23,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:14:23,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:23,438 INFO L124 PetriNetUnfolderBase]: 2787/4654 cut-off events. [2025-03-04 10:14:23,438 INFO L125 PetriNetUnfolderBase]: For 2838/2910 co-relation queries the response was YES. [2025-03-04 10:14:23,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11024 conditions, 4654 events. 2787/4654 cut-off events. For 2838/2910 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28566 event pairs, 1116 based on Foata normal form. 101/3861 useless extension candidates. Maximal degree in co-relation 9823. Up to 2697 conditions per place. [2025-03-04 10:14:23,462 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 74 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2025-03-04 10:14:23,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 539 flow [2025-03-04 10:14:23,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:23,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2025-03-04 10:14:23,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6242937853107344 [2025-03-04 10:14:23,464 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 213 flow. Second operand 6 states and 221 transitions. [2025-03-04 10:14:23,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 539 flow [2025-03-04 10:14:23,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 97 transitions, 508 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:23,471 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 243 flow [2025-03-04 10:14:23,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2025-03-04 10:14:23,472 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-04 10:14:23,472 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 243 flow [2025-03-04 10:14:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.666666666666668) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:23,472 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:23,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:14:23,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:23,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:23,472 INFO L85 PathProgramCache]: Analyzing trace with hash -67567845, now seen corresponding path program 1 times [2025-03-04 10:14:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:23,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493172457] [2025-03-04 10:14:23,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:23,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:23,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:14:23,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:14:23,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:23,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:23,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:23,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493172457] [2025-03-04 10:14:23,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493172457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:23,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877883033] [2025-03-04 10:14:23,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:23,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:23,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:14:23,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:14:23,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:14:23,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:23,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:23,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:14:23,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:23,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:23,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877883033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:23,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:23,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:14:23,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996459761] [2025-03-04 10:14:23,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:23,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:14:23,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:23,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:14:23,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:14:23,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:23,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:23,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:23,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:23,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:24,042 INFO L124 PetriNetUnfolderBase]: 2173/3912 cut-off events. [2025-03-04 10:14:24,042 INFO L125 PetriNetUnfolderBase]: For 3554/3610 co-relation queries the response was YES. [2025-03-04 10:14:24,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 3912 events. 2173/3912 cut-off events. For 3554/3610 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25719 event pairs, 1186 based on Foata normal form. 0/3249 useless extension candidates. Maximal degree in co-relation 8981. Up to 2674 conditions per place. [2025-03-04 10:14:24,061 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 55 selfloop transitions, 8 changer transitions 0/79 dead transitions. [2025-03-04 10:14:24,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 441 flow [2025-03-04 10:14:24,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:14:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:14:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 254 transitions. [2025-03-04 10:14:24,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6150121065375302 [2025-03-04 10:14:24,064 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 243 flow. Second operand 7 states and 254 transitions. [2025-03-04 10:14:24,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 441 flow [2025-03-04 10:14:24,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 79 transitions, 424 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:14:24,070 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 259 flow [2025-03-04 10:14:24,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2025-03-04 10:14:24,071 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2025-03-04 10:14:24,072 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 259 flow [2025-03-04 10:14:24,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 30.166666666666668) internal successors, (362), 12 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:24,073 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:24,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:24,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:24,273 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:24,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:24,274 INFO L85 PathProgramCache]: Analyzing trace with hash 857791958, now seen corresponding path program 1 times [2025-03-04 10:14:24,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575122397] [2025-03-04 10:14:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:24,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:14:24,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:14:24,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:24,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:24,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575122397] [2025-03-04 10:14:24,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575122397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:24,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86898693] [2025-03-04 10:14:24,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:24,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:24,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:24,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:24,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:14:24,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:14:24,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:14:24,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:24,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:24,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:14:24,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:24,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:24,480 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86898693] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:24,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-03-04 10:14:24,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122681410] [2025-03-04 10:14:24,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:24,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:14:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:24,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:14:24,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:14:24,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:24,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 259 flow. Second operand has 17 states, 17 states have (on average 29.764705882352942) internal successors, (506), 17 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:24,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:24,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:24,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:25,112 INFO L124 PetriNetUnfolderBase]: 3696/6554 cut-off events. [2025-03-04 10:14:25,113 INFO L125 PetriNetUnfolderBase]: For 4916/5038 co-relation queries the response was YES. [2025-03-04 10:14:25,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16441 conditions, 6554 events. 3696/6554 cut-off events. For 4916/5038 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 45752 event pairs, 1497 based on Foata normal form. 0/5537 useless extension candidates. Maximal degree in co-relation 8896. Up to 2672 conditions per place. [2025-03-04 10:14:25,143 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 104 selfloop transitions, 14 changer transitions 0/134 dead transitions. [2025-03-04 10:14:25,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 134 transitions, 784 flow [2025-03-04 10:14:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:14:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:14:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 346 transitions. [2025-03-04 10:14:25,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516007532956686 [2025-03-04 10:14:25,145 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 259 flow. Second operand 9 states and 346 transitions. [2025-03-04 10:14:25,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 134 transitions, 784 flow [2025-03-04 10:14:25,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 134 transitions, 769 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:25,154 INFO L231 Difference]: Finished difference. Result has 83 places, 69 transitions, 346 flow [2025-03-04 10:14:25,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=346, PETRI_PLACES=83, PETRI_TRANSITIONS=69} [2025-03-04 10:14:25,155 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2025-03-04 10:14:25,155 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 69 transitions, 346 flow [2025-03-04 10:14:25,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 29.764705882352942) internal successors, (506), 17 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:25,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:25,155 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:25,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:14:25,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:14:25,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:25,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -712995270, now seen corresponding path program 2 times [2025-03-04 10:14:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:25,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868910274] [2025-03-04 10:14:25,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:25,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:25,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:14:25,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:14:25,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:25,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:25,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:25,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868910274] [2025-03-04 10:14:25,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868910274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:25,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205943749] [2025-03-04 10:14:25,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:25,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:25,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:25,497 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:25,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:14:25,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 10:14:25,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:14:25,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:25,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:25,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 10:14:25,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:25,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:14:25,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205943749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:25,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:14:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2025-03-04 10:14:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166135906] [2025-03-04 10:14:25,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:25,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:25,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:25,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:25,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:14:25,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:14:25,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 69 transitions, 346 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:25,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:25,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:14:25,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:26,202 INFO L124 PetriNetUnfolderBase]: 3590/6220 cut-off events. [2025-03-04 10:14:26,202 INFO L125 PetriNetUnfolderBase]: For 8220/8278 co-relation queries the response was YES. [2025-03-04 10:14:26,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16998 conditions, 6220 events. 3590/6220 cut-off events. For 8220/8278 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 41906 event pairs, 966 based on Foata normal form. 242/5521 useless extension candidates. Maximal degree in co-relation 12668. Up to 2275 conditions per place. [2025-03-04 10:14:26,234 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 93 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2025-03-04 10:14:26,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 117 transitions, 848 flow [2025-03-04 10:14:26,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2025-03-04 10:14:26,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6016949152542372 [2025-03-04 10:14:26,236 INFO L175 Difference]: Start difference. First operand has 83 places, 69 transitions, 346 flow. Second operand 6 states and 213 transitions. [2025-03-04 10:14:26,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 117 transitions, 848 flow [2025-03-04 10:14:26,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 117 transitions, 829 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 10:14:26,252 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 351 flow [2025-03-04 10:14:26,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2025-03-04 10:14:26,255 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-03-04 10:14:26,255 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 351 flow [2025-03-04 10:14:26,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:26,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:26,256 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:26,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:26,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:26,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1354864209, now seen corresponding path program 1 times [2025-03-04 10:14:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:26,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101242327] [2025-03-04 10:14:26,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:26,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:26,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:14:26,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:14:26,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:26,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:26,567 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101242327] [2025-03-04 10:14:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101242327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541337178] [2025-03-04 10:14:26,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:26,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:26,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:26,570 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:26,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:14:26,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:14:26,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:14:26,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:26,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:26,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:14:26,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:26,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:14:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541337178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:26,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:26,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-04 10:14:26,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536261981] [2025-03-04 10:14:26,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:26,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:14:26,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:26,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:14:26,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:14:26,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:26,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 351 flow. Second operand has 18 states, 18 states have (on average 29.944444444444443) internal successors, (539), 18 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:26,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:26,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:26,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:27,451 INFO L124 PetriNetUnfolderBase]: 3256/5494 cut-off events. [2025-03-04 10:14:27,452 INFO L125 PetriNetUnfolderBase]: For 7861/7973 co-relation queries the response was YES. [2025-03-04 10:14:27,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16184 conditions, 5494 events. 3256/5494 cut-off events. For 7861/7973 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 34822 event pairs, 1412 based on Foata normal form. 0/4753 useless extension candidates. Maximal degree in co-relation 12096. Up to 2672 conditions per place. [2025-03-04 10:14:27,471 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 96 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2025-03-04 10:14:27,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 857 flow [2025-03-04 10:14:27,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:14:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:14:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 344 transitions. [2025-03-04 10:14:27,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.647834274952919 [2025-03-04 10:14:27,473 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 351 flow. Second operand 9 states and 344 transitions. [2025-03-04 10:14:27,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 857 flow [2025-03-04 10:14:27,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 124 transitions, 809 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:27,483 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 403 flow [2025-03-04 10:14:27,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=403, PETRI_PLACES=90, PETRI_TRANSITIONS=71} [2025-03-04 10:14:27,483 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2025-03-04 10:14:27,483 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 403 flow [2025-03-04 10:14:27,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 29.944444444444443) internal successors, (539), 18 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:27,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:27,484 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:27,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:27,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:27,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:27,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:27,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1970589033, now seen corresponding path program 2 times [2025-03-04 10:14:27,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:27,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609673007] [2025-03-04 10:14:27,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:27,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:27,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:14:27,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:14:27,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:27,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:14:27,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:27,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609673007] [2025-03-04 10:14:27,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609673007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:27,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:27,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:14:27,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700120134] [2025-03-04 10:14:27,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:27,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:27,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:27,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:27,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:27,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:14:27,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:27,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:27,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:14:27,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:28,382 INFO L124 PetriNetUnfolderBase]: 6600/10183 cut-off events. [2025-03-04 10:14:28,383 INFO L125 PetriNetUnfolderBase]: For 15730/15848 co-relation queries the response was YES. [2025-03-04 10:14:28,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30561 conditions, 10183 events. 6600/10183 cut-off events. For 15730/15848 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 63525 event pairs, 2550 based on Foata normal form. 0/8693 useless extension candidates. Maximal degree in co-relation 22024. Up to 5352 conditions per place. [2025-03-04 10:14:28,430 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 123 selfloop transitions, 10 changer transitions 0/145 dead transitions. [2025-03-04 10:14:28,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 1022 flow [2025-03-04 10:14:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-03-04 10:14:28,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7322033898305085 [2025-03-04 10:14:28,432 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 403 flow. Second operand 5 states and 216 transitions. [2025-03-04 10:14:28,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 1022 flow [2025-03-04 10:14:28,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 145 transitions, 994 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:28,467 INFO L231 Difference]: Finished difference. Result has 93 places, 77 transitions, 467 flow [2025-03-04 10:14:28,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=467, PETRI_PLACES=93, PETRI_TRANSITIONS=77} [2025-03-04 10:14:28,468 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 35 predicate places. [2025-03-04 10:14:28,468 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 77 transitions, 467 flow [2025-03-04 10:14:28,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:28,468 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:28,468 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:28,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:14:28,468 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:28,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:28,469 INFO L85 PathProgramCache]: Analyzing trace with hash -714698192, now seen corresponding path program 2 times [2025-03-04 10:14:28,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:28,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-03-04 10:14:28,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:28,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:14:28,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:28,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:28,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:14:28,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:28,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737421442] [2025-03-04 10:14:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737421442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:28,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:28,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:14:28,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860060854] [2025-03-04 10:14:28,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:28,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:14:28,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:28,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:14:28,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:14:28,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:14:28,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 77 transitions, 467 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:28,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:28,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:14:28,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:29,585 INFO L124 PetriNetUnfolderBase]: 9271/14078 cut-off events. [2025-03-04 10:14:29,586 INFO L125 PetriNetUnfolderBase]: For 28621/29357 co-relation queries the response was YES. [2025-03-04 10:14:29,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44340 conditions, 14078 events. 9271/14078 cut-off events. For 28621/29357 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 88073 event pairs, 4106 based on Foata normal form. 400/12843 useless extension candidates. Maximal degree in co-relation 31499. Up to 7952 conditions per place. [2025-03-04 10:14:29,734 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 138 selfloop transitions, 10 changer transitions 0/161 dead transitions. [2025-03-04 10:14:29,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 161 transitions, 1251 flow [2025-03-04 10:14:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:14:29,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:14:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2025-03-04 10:14:29,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7186440677966102 [2025-03-04 10:14:29,735 INFO L175 Difference]: Start difference. First operand has 93 places, 77 transitions, 467 flow. Second operand 5 states and 212 transitions. [2025-03-04 10:14:29,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 161 transitions, 1251 flow [2025-03-04 10:14:29,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 161 transitions, 1243 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-03-04 10:14:29,773 INFO L231 Difference]: Finished difference. Result has 101 places, 83 transitions, 547 flow [2025-03-04 10:14:29,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=93, 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=547, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2025-03-04 10:14:29,773 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 43 predicate places. [2025-03-04 10:14:29,774 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 547 flow [2025-03-04 10:14:29,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:29,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:29,774 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:29,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 10:14:29,774 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:29,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:29,774 INFO L85 PathProgramCache]: Analyzing trace with hash -620406020, now seen corresponding path program 1 times [2025-03-04 10:14:29,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:29,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848396345] [2025-03-04 10:14:29,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:29,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:14:29,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:29,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:29,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:29,934 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:29,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848396345] [2025-03-04 10:14:29,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848396345] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:29,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631176761] [2025-03-04 10:14:29,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:29,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:29,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:29,936 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:29,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:14:29,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:14:29,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:14:29,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:29,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:29,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:14:29,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:14:30,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:14:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631176761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:14:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2025-03-04 10:14:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931316407] [2025-03-04 10:14:30,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:30,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:30,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:30,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:14:30,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:14:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 83 transitions, 547 flow. Second operand has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:30,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:30,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:14:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:31,026 INFO L124 PetriNetUnfolderBase]: 7399/11867 cut-off events. [2025-03-04 10:14:31,026 INFO L125 PetriNetUnfolderBase]: For 24883/25519 co-relation queries the response was YES. [2025-03-04 10:14:31,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40109 conditions, 11867 events. 7399/11867 cut-off events. For 24883/25519 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 79629 event pairs, 1544 based on Foata normal form. 434/11585 useless extension candidates. Maximal degree in co-relation 28132. Up to 3411 conditions per place. [2025-03-04 10:14:31,077 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 158 selfloop transitions, 20 changer transitions 0/192 dead transitions. [2025-03-04 10:14:31,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 192 transitions, 1557 flow [2025-03-04 10:14:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:14:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:14:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 305 transitions. [2025-03-04 10:14:31,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6461864406779662 [2025-03-04 10:14:31,078 INFO L175 Difference]: Start difference. First operand has 101 places, 83 transitions, 547 flow. Second operand 8 states and 305 transitions. [2025-03-04 10:14:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 192 transitions, 1557 flow [2025-03-04 10:14:31,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 192 transitions, 1547 flow, removed 5 selfloop flow, removed 0 redundant places. [2025-03-04 10:14:31,221 INFO L231 Difference]: Finished difference. Result has 107 places, 85 transitions, 595 flow [2025-03-04 10:14:31,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=595, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2025-03-04 10:14:31,221 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 49 predicate places. [2025-03-04 10:14:31,221 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 595 flow [2025-03-04 10:14:31,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:31,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:31,222 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:31,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:14:31,422 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,SelfDestructingSolverStorable15 [2025-03-04 10:14:31,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:31,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:31,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2052717102, now seen corresponding path program 1 times [2025-03-04 10:14:31,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:31,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052711039] [2025-03-04 10:14:31,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:31,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:31,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:14:31,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:14:31,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:31,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052711039] [2025-03-04 10:14:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052711039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762894575] [2025-03-04 10:14:31,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:31,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:31,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:31,613 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:31,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:14:31,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:14:31,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:14:31,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:31,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:31,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:14:31,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:31,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:31,779 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:31,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762894575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:31,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:31,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 10:14:31,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694163190] [2025-03-04 10:14:31,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:31,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:14:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:31,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:14:31,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:14:32,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 10:14:32,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 595 flow. Second operand has 26 states, 26 states have (on average 23.96153846153846) internal successors, (623), 26 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:32,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:32,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 10:14:32,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:34,494 INFO L124 PetriNetUnfolderBase]: 14597/21779 cut-off events. [2025-03-04 10:14:34,494 INFO L125 PetriNetUnfolderBase]: For 51796/52516 co-relation queries the response was YES. [2025-03-04 10:14:34,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75077 conditions, 21779 events. 14597/21779 cut-off events. For 51796/52516 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 134310 event pairs, 5322 based on Foata normal form. 696/21501 useless extension candidates. Maximal degree in co-relation 59374. Up to 7700 conditions per place. [2025-03-04 10:14:34,611 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 177 selfloop transitions, 20 changer transitions 0/208 dead transitions. [2025-03-04 10:14:34,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 208 transitions, 1569 flow [2025-03-04 10:14:34,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:14:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:14:34,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 392 transitions. [2025-03-04 10:14:34,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6040061633281972 [2025-03-04 10:14:34,612 INFO L175 Difference]: Start difference. First operand has 107 places, 85 transitions, 595 flow. Second operand 11 states and 392 transitions. [2025-03-04 10:14:34,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 208 transitions, 1569 flow [2025-03-04 10:14:34,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 208 transitions, 1532 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:34,731 INFO L231 Difference]: Finished difference. Result has 116 places, 92 transitions, 682 flow [2025-03-04 10:14:34,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=682, PETRI_PLACES=116, PETRI_TRANSITIONS=92} [2025-03-04 10:14:34,731 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 58 predicate places. [2025-03-04 10:14:34,731 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 92 transitions, 682 flow [2025-03-04 10:14:34,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 23.96153846153846) internal successors, (623), 26 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:34,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:34,732 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:34,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:34,936 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,SelfDestructingSolverStorable16 [2025-03-04 10:14:34,936 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:34,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash -594195051, now seen corresponding path program 1 times [2025-03-04 10:14:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:34,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668130044] [2025-03-04 10:14:34,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:34,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:34,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:14:34,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:14:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:35,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:35,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668130044] [2025-03-04 10:14:35,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668130044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:35,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445802047] [2025-03-04 10:14:35,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:35,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:35,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:35,094 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:35,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:14:35,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:14:35,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:14:35,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:35,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:35,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:14:35,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 10:14:35,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:14:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445802047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:35,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:14:35,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2025-03-04 10:14:35,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534563568] [2025-03-04 10:14:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:35,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:14:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:35,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:14:35,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:14:35,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:14:35,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 92 transitions, 682 flow. Second operand has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:35,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:35,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:14:35,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:36,525 INFO L124 PetriNetUnfolderBase]: 9917/15554 cut-off events. [2025-03-04 10:14:36,525 INFO L125 PetriNetUnfolderBase]: For 50259/50461 co-relation queries the response was YES. [2025-03-04 10:14:36,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56447 conditions, 15554 events. 9917/15554 cut-off events. For 50259/50461 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 102327 event pairs, 1714 based on Foata normal form. 228/15027 useless extension candidates. Maximal degree in co-relation 44025. Up to 4749 conditions per place. [2025-03-04 10:14:36,596 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 202 selfloop transitions, 20 changer transitions 0/235 dead transitions. [2025-03-04 10:14:36,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 235 transitions, 2227 flow [2025-03-04 10:14:36,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:14:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:14:36,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 301 transitions. [2025-03-04 10:14:36,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6377118644067796 [2025-03-04 10:14:36,597 INFO L175 Difference]: Start difference. First operand has 116 places, 92 transitions, 682 flow. Second operand 8 states and 301 transitions. [2025-03-04 10:14:36,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 235 transitions, 2227 flow [2025-03-04 10:14:36,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 235 transitions, 2117 flow, removed 27 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:36,734 INFO L231 Difference]: Finished difference. Result has 115 places, 94 transitions, 690 flow [2025-03-04 10:14:36,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=690, PETRI_PLACES=115, PETRI_TRANSITIONS=94} [2025-03-04 10:14:36,735 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 57 predicate places. [2025-03-04 10:14:36,735 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 94 transitions, 690 flow [2025-03-04 10:14:36,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.857142857142858) internal successors, (195), 7 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:36,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:36,735 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:36,741 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-04 10:14:36,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:14:36,936 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:36,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:36,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1240177051, now seen corresponding path program 1 times [2025-03-04 10:14:36,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:36,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079934867] [2025-03-04 10:14:36,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:36,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:36,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:36,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:36,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 10:14:37,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:37,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079934867] [2025-03-04 10:14:37,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079934867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:37,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105371126] [2025-03-04 10:14:37,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:37,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:37,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:37,085 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:37,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:14:37,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:37,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:37,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:37,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:37,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:14:37,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:37,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:37,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105371126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:37,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 21 [2025-03-04 10:14:37,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60925086] [2025-03-04 10:14:37,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:37,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:14:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:37,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:14:37,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:14:38,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-04 10:14:38,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 94 transitions, 690 flow. Second operand has 23 states, 23 states have (on average 25.347826086956523) internal successors, (583), 23 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:38,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:38,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-04 10:14:38,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:40,913 INFO L124 PetriNetUnfolderBase]: 19593/29291 cut-off events. [2025-03-04 10:14:40,913 INFO L125 PetriNetUnfolderBase]: For 87742/87742 co-relation queries the response was YES. [2025-03-04 10:14:41,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106222 conditions, 29291 events. 19593/29291 cut-off events. For 87742/87742 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 186550 event pairs, 4222 based on Foata normal form. 556/28641 useless extension candidates. Maximal degree in co-relation 89797. Up to 6790 conditions per place. [2025-03-04 10:14:41,194 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 250 selfloop transitions, 26 changer transitions 0/286 dead transitions. [2025-03-04 10:14:41,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 286 transitions, 2394 flow [2025-03-04 10:14:41,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:14:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:14:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 500 transitions. [2025-03-04 10:14:41,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6053268765133172 [2025-03-04 10:14:41,195 INFO L175 Difference]: Start difference. First operand has 115 places, 94 transitions, 690 flow. Second operand 14 states and 500 transitions. [2025-03-04 10:14:41,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 286 transitions, 2394 flow [2025-03-04 10:14:41,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 286 transitions, 2347 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:41,671 INFO L231 Difference]: Finished difference. Result has 127 places, 103 transitions, 808 flow [2025-03-04 10:14:41,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=808, PETRI_PLACES=127, PETRI_TRANSITIONS=103} [2025-03-04 10:14:41,671 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 69 predicate places. [2025-03-04 10:14:41,671 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 103 transitions, 808 flow [2025-03-04 10:14:41,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 25.347826086956523) internal successors, (583), 23 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:41,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:41,672 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-04 10:14:41,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:41,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:41,873 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:41,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2096764639, now seen corresponding path program 1 times [2025-03-04 10:14:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015014209] [2025-03-04 10:14:41,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:41,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:14:41,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:14:41,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:41,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:41,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:14:41,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015014209] [2025-03-04 10:14:41,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015014209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:14:41,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:14:41,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:14:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089638667] [2025-03-04 10:14:41,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:41,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:14:41,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:41,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:14:41,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:14:41,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:41,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 103 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:41,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:41,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:41,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:43,275 INFO L124 PetriNetUnfolderBase]: 13939/21817 cut-off events. [2025-03-04 10:14:43,275 INFO L125 PetriNetUnfolderBase]: For 88690/88786 co-relation queries the response was YES. [2025-03-04 10:14:43,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84257 conditions, 21817 events. 13939/21817 cut-off events. For 88690/88786 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 147204 event pairs, 2902 based on Foata normal form. 3/20650 useless extension candidates. Maximal degree in co-relation 69469. Up to 16656 conditions per place. [2025-03-04 10:14:43,445 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 104 selfloop transitions, 11 changer transitions 8/138 dead transitions. [2025-03-04 10:14:43,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 138 transitions, 1304 flow [2025-03-04 10:14:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:14:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:14:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2025-03-04 10:14:43,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7740112994350282 [2025-03-04 10:14:43,446 INFO L175 Difference]: Start difference. First operand has 127 places, 103 transitions, 808 flow. Second operand 3 states and 137 transitions. [2025-03-04 10:14:43,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 138 transitions, 1304 flow [2025-03-04 10:14:43,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 138 transitions, 1257 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:43,590 INFO L231 Difference]: Finished difference. Result has 123 places, 105 transitions, 832 flow [2025-03-04 10:14:43,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=832, PETRI_PLACES=123, PETRI_TRANSITIONS=105} [2025-03-04 10:14:43,590 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 65 predicate places. [2025-03-04 10:14:43,591 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 105 transitions, 832 flow [2025-03-04 10:14:43,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:43,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:43,591 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:14:43,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:14:43,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:43,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash 415897533, now seen corresponding path program 2 times [2025-03-04 10:14:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:43,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102580384] [2025-03-04 10:14:43,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:43,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:14:43,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:14:43,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:43,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:43,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:43,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102580384] [2025-03-04 10:14:43,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102580384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:43,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559667603] [2025-03-04 10:14:43,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:43,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:43,692 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:43,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:14:43,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:14:43,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:14:43,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:43,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:43,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:14:43,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:43,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:43,953 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 13 treesize of output 11 [2025-03-04 10:14:44,049 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:44,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559667603] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:44,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:44,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25 [2025-03-04 10:14:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250876133] [2025-03-04 10:14:44,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:44,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:14:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:44,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:14:44,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:14:44,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:14:44,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 105 transitions, 832 flow. Second operand has 26 states, 26 states have (on average 27.076923076923077) internal successors, (704), 26 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:44,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:44,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:14:44,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:47,667 INFO L124 PetriNetUnfolderBase]: 27399/41052 cut-off events. [2025-03-04 10:14:47,667 INFO L125 PetriNetUnfolderBase]: For 166145/166145 co-relation queries the response was YES. [2025-03-04 10:14:47,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161424 conditions, 41052 events. 27399/41052 cut-off events. For 166145/166145 co-relation queries the response was YES. Maximal size of possible extension queue 1186. Compared 283932 event pairs, 9618 based on Foata normal form. 388/39266 useless extension candidates. Maximal degree in co-relation 144674. Up to 15082 conditions per place. [2025-03-04 10:14:47,922 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 400 selfloop transitions, 40 changer transitions 0/453 dead transitions. [2025-03-04 10:14:47,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 453 transitions, 4411 flow [2025-03-04 10:14:47,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:14:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:14:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 603 transitions. [2025-03-04 10:14:47,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638771186440678 [2025-03-04 10:14:47,923 INFO L175 Difference]: Start difference. First operand has 123 places, 105 transitions, 832 flow. Second operand 16 states and 603 transitions. [2025-03-04 10:14:47,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 453 transitions, 4411 flow [2025-03-04 10:14:48,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 453 transitions, 4245 flow, removed 68 selfloop flow, removed 7 redundant places. [2025-03-04 10:14:48,323 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 1137 flow [2025-03-04 10:14:48,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1137, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2025-03-04 10:14:48,323 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 74 predicate places. [2025-03-04 10:14:48,324 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 1137 flow [2025-03-04 10:14:48,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 27.076923076923077) internal successors, (704), 26 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:48,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:48,324 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:14:48,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:48,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 10:14:48,524 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:48,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash -20566210, now seen corresponding path program 3 times [2025-03-04 10:14:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:48,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127623894] [2025-03-04 10:14:48,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:48,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 6 equivalence classes. [2025-03-04 10:14:48,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-03-04 10:14:48,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:48,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:48,595 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 10:14:48,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127623894] [2025-03-04 10:14:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127623894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:48,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530876270] [2025-03-04 10:14:48,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:14:48,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:48,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:48,598 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:48,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:14:48,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 6 equivalence classes. [2025-03-04 10:14:48,652 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-03-04 10:14:48,652 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:14:48,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:48,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:14:48,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:48,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:14:48,701 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 10:14:48,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 10:14:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530876270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:14:48,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:14:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:14:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329647553] [2025-03-04 10:14:48,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:14:48,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:14:48,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:48,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:14:48,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:14:49,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 59 [2025-03-04 10:14:49,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 1137 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:49,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:49,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 59 [2025-03-04 10:14:49,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:53,790 INFO L124 PetriNetUnfolderBase]: 36679/55195 cut-off events. [2025-03-04 10:14:53,790 INFO L125 PetriNetUnfolderBase]: For 262078/262078 co-relation queries the response was YES. [2025-03-04 10:14:53,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218067 conditions, 55195 events. 36679/55195 cut-off events. For 262078/262078 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 395080 event pairs, 12299 based on Foata normal form. 268/53249 useless extension candidates. Maximal degree in co-relation 185934. Up to 26967 conditions per place. [2025-03-04 10:14:54,145 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 178 selfloop transitions, 29 changer transitions 0/216 dead transitions. [2025-03-04 10:14:54,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 216 transitions, 2255 flow [2025-03-04 10:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:14:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:14:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-03-04 10:14:54,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5819209039548022 [2025-03-04 10:14:54,146 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 1137 flow. Second operand 6 states and 206 transitions. [2025-03-04 10:14:54,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 216 transitions, 2255 flow [2025-03-04 10:14:55,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 216 transitions, 2219 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:55,779 INFO L231 Difference]: Finished difference. Result has 132 places, 122 transitions, 1153 flow [2025-03-04 10:14:55,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1153, PETRI_PLACES=132, PETRI_TRANSITIONS=122} [2025-03-04 10:14:55,780 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 74 predicate places. [2025-03-04 10:14:55,780 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 122 transitions, 1153 flow [2025-03-04 10:14:55,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:55,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:55,780 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] [2025-03-04 10:14:55,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:14:55,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 10:14:55,981 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1573789176, now seen corresponding path program 1 times [2025-03-04 10:14:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543546109] [2025-03-04 10:14:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:55,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:14:55,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:14:55,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:55,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:56,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543546109] [2025-03-04 10:14:56,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543546109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:56,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318458989] [2025-03-04 10:14:56,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:56,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:56,055 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:56,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:14:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:14:56,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:14:56,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:56,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:56,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:14:56,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:56,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:56,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:14:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318458989] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:14:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2025-03-04 10:14:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966139599] [2025-03-04 10:14:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:14:56,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:14:56,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:14:56,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:14:56,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:14:56,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:14:56,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 122 transitions, 1153 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:56,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:14:56,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:14:56,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:58,753 INFO L124 PetriNetUnfolderBase]: 20989/36170 cut-off events. [2025-03-04 10:14:58,753 INFO L125 PetriNetUnfolderBase]: For 195614/195614 co-relation queries the response was YES. [2025-03-04 10:14:58,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136706 conditions, 36170 events. 20989/36170 cut-off events. For 195614/195614 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 303679 event pairs, 6861 based on Foata normal form. 0/33191 useless extension candidates. Maximal degree in co-relation 114525. Up to 14979 conditions per place. [2025-03-04 10:14:59,030 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 365 selfloop transitions, 37 changer transitions 0/416 dead transitions. [2025-03-04 10:14:59,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 416 transitions, 5246 flow [2025-03-04 10:14:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:14:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:14:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 381 transitions. [2025-03-04 10:14:59,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6457627118644068 [2025-03-04 10:14:59,031 INFO L175 Difference]: Start difference. First operand has 132 places, 122 transitions, 1153 flow. Second operand 10 states and 381 transitions. [2025-03-04 10:14:59,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 416 transitions, 5246 flow [2025-03-04 10:14:59,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 416 transitions, 4948 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:14:59,474 INFO L231 Difference]: Finished difference. Result has 138 places, 142 transitions, 1339 flow [2025-03-04 10:14:59,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1339, PETRI_PLACES=138, PETRI_TRANSITIONS=142} [2025-03-04 10:14:59,474 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 80 predicate places. [2025-03-04 10:14:59,475 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 142 transitions, 1339 flow [2025-03-04 10:14:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:59,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:59,475 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] [2025-03-04 10:14:59,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:14:59,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:59,676 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:14:59,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 846398634, now seen corresponding path program 2 times [2025-03-04 10:14:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:59,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476169133] [2025-03-04 10:14:59,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:59,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:14:59,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:14:59,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:14:59,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476169133] [2025-03-04 10:14:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476169133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151666683] [2025-03-04 10:14:59,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:14:59,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:59,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:59,727 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:59,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:14:59,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:14:59,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:14:59,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:14:59,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:59,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:14:59,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:00,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151666683] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:00,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:15:00,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-03-04 10:15:00,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783450889] [2025-03-04 10:15:00,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:00,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:15:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:00,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:15:00,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:15:00,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:15:00,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 142 transitions, 1339 flow. Second operand has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:00,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:00,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:15:00,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:03,953 INFO L124 PetriNetUnfolderBase]: 29515/48295 cut-off events. [2025-03-04 10:15:03,954 INFO L125 PetriNetUnfolderBase]: For 279461/279461 co-relation queries the response was YES. [2025-03-04 10:15:04,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197535 conditions, 48295 events. 29515/48295 cut-off events. For 279461/279461 co-relation queries the response was YES. Maximal size of possible extension queue 1461. Compared 393810 event pairs, 4974 based on Foata normal form. 92/47422 useless extension candidates. Maximal degree in co-relation 165002. Up to 11009 conditions per place. [2025-03-04 10:15:04,303 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 361 selfloop transitions, 92 changer transitions 0/467 dead transitions. [2025-03-04 10:15:04,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 467 transitions, 5664 flow [2025-03-04 10:15:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:15:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:15:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 374 transitions. [2025-03-04 10:15:04,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338983050847458 [2025-03-04 10:15:04,304 INFO L175 Difference]: Start difference. First operand has 138 places, 142 transitions, 1339 flow. Second operand 10 states and 374 transitions. [2025-03-04 10:15:04,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 467 transitions, 5664 flow [2025-03-04 10:15:05,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 467 transitions, 5651 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:05,187 INFO L231 Difference]: Finished difference. Result has 150 places, 197 transitions, 2272 flow [2025-03-04 10:15:05,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2272, PETRI_PLACES=150, PETRI_TRANSITIONS=197} [2025-03-04 10:15:05,188 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 92 predicate places. [2025-03-04 10:15:05,188 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 197 transitions, 2272 flow [2025-03-04 10:15:05,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.0) internal successors, (248), 8 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:05,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:05,189 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] [2025-03-04 10:15:05,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:15:05,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:05,389 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:15:05,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1304070797, now seen corresponding path program 1 times [2025-03-04 10:15:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:05,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604565247] [2025-03-04 10:15:05,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:15:05,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:05,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:15:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:05,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:15:05,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:15:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604565247] [2025-03-04 10:15:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604565247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:15:05,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:15:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:15:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996250204] [2025-03-04 10:15:05,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:05,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:15:05,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:05,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:15:05,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:15:05,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:15:05,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 197 transitions, 2272 flow. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:05,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:05,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:15:05,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:10,285 INFO L124 PetriNetUnfolderBase]: 32917/52451 cut-off events. [2025-03-04 10:15:10,285 INFO L125 PetriNetUnfolderBase]: For 424560/424560 co-relation queries the response was YES. [2025-03-04 10:15:10,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254271 conditions, 52451 events. 32917/52451 cut-off events. For 424560/424560 co-relation queries the response was YES. Maximal size of possible extension queue 1602. Compared 420580 event pairs, 13013 based on Foata normal form. 84/51365 useless extension candidates. Maximal degree in co-relation 218190. Up to 31652 conditions per place. [2025-03-04 10:15:10,753 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 391 selfloop transitions, 29 changer transitions 3/437 dead transitions. [2025-03-04 10:15:10,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 437 transitions, 5985 flow [2025-03-04 10:15:10,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:10,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 246 transitions. [2025-03-04 10:15:10,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6949152542372882 [2025-03-04 10:15:10,754 INFO L175 Difference]: Start difference. First operand has 150 places, 197 transitions, 2272 flow. Second operand 6 states and 246 transitions. [2025-03-04 10:15:10,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 437 transitions, 5985 flow [2025-03-04 10:15:14,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 437 transitions, 5968 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 10:15:14,154 INFO L231 Difference]: Finished difference. Result has 154 places, 205 transitions, 2464 flow [2025-03-04 10:15:14,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2263, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2464, PETRI_PLACES=154, PETRI_TRANSITIONS=205} [2025-03-04 10:15:14,154 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 96 predicate places. [2025-03-04 10:15:14,154 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 205 transitions, 2464 flow [2025-03-04 10:15:14,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:14,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:15:14,154 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] [2025-03-04 10:15:14,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 10:15:14,155 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2025-03-04 10:15:14,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:15:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash 150179683, now seen corresponding path program 2 times [2025-03-04 10:15:14,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:15:14,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607973516] [2025-03-04 10:15:14,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:14,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:15:14,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:14,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:14,164 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:14,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:15:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:15:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607973516] [2025-03-04 10:15:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607973516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048761034] [2025-03-04 10:15:14,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:15:14,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:15:14,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:15:14,204 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:15:14,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:15:14,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:15:14,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:15:14,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:15:14,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:15:14,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:15:14,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:15:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:14,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:15:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:15:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048761034] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:15:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:15:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-03-04 10:15:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679340362] [2025-03-04 10:15:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:15:14,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:15:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:15:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:15:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:15:14,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 59 [2025-03-04 10:15:14,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 205 transitions, 2464 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:15:14,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:15:14,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 59 [2025-03-04 10:15:14,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:15:18,708 INFO L124 PetriNetUnfolderBase]: 29876/48021 cut-off events. [2025-03-04 10:15:18,708 INFO L125 PetriNetUnfolderBase]: For 424945/424945 co-relation queries the response was YES. [2025-03-04 10:15:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235897 conditions, 48021 events. 29876/48021 cut-off events. For 424945/424945 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 381929 event pairs, 8640 based on Foata normal form. 760/47919 useless extension candidates. Maximal degree in co-relation 202764. Up to 22341 conditions per place. [2025-03-04 10:15:19,354 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 265 selfloop transitions, 29 changer transitions 0/308 dead transitions. [2025-03-04 10:15:19,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 308 transitions, 4356 flow [2025-03-04 10:15:19,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:15:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:15:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2025-03-04 10:15:19,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6129943502824858 [2025-03-04 10:15:19,355 INFO L175 Difference]: Start difference. First operand has 154 places, 205 transitions, 2464 flow. Second operand 6 states and 217 transitions. [2025-03-04 10:15:19,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 308 transitions, 4356 flow