./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:32:40,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:32:40,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 14:32:40,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:32:40,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:32:40,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:32:40,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:32:40,899 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:32:40,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:32:40,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:32:40,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:32:40,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:32:40,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:32:40,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:32:40,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:32:40,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:32:40,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:32:40,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:32:40,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:32:40,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:32:40,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:32:40,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:32:40,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:32:40,904 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2025-03-17 14:32:41,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:32:41,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:32:41,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:32:41,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:32:41,132 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:32:41,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-17 14:32:42,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ab16b25/6f9ad701797d4323a8be2221bf9f0cf6/FLAGe85ed9411 [2025-03-17 14:32:42,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:32:42,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2025-03-17 14:32:42,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ab16b25/6f9ad701797d4323a8be2221bf9f0cf6/FLAGe85ed9411 [2025-03-17 14:32:42,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36ab16b25/6f9ad701797d4323a8be2221bf9f0cf6 [2025-03-17 14:32:42,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:32:42,817 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:32:42,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:32:42,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:32:42,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:32:42,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:42,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc7117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42, skipping insertion in model container [2025-03-17 14:32:42,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:42,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:32:42,946 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-17 14:32:42,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:32:42,955 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:32:42,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:32:42,984 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:32:42,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42 WrapperNode [2025-03-17 14:32:42,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:32:42,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:32:42,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:32:42,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:32:42,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:42,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,008 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 188 [2025-03-17 14:32:43,008 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:32:43,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:32:43,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:32:43,009 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:32:43,014 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,031 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-17 14:32:43,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,042 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:32:43,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:32:43,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:32:43,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:32:43,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (1/1) ... [2025-03-17 14:32:43,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:32:43,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:32:43,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 14:32:43,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 14:32:43,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 14:32:43,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 14:32:43,093 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 14:32:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:32:43,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:32:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 14:32:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 14:32:43,095 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 14:32:43,173 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:32:43,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:32:43,506 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 14:32:43,507 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:32:43,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:32:43,717 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:32:43,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:32:43 BoogieIcfgContainer [2025-03-17 14:32:43,718 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:32:43,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:32:43,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:32:43,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:32:43,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:32:42" (1/3) ... [2025-03-17 14:32:43,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96f7917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:32:43, skipping insertion in model container [2025-03-17 14:32:43,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:32:42" (2/3) ... [2025-03-17 14:32:43,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96f7917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:32:43, skipping insertion in model container [2025-03-17 14:32:43,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:32:43" (3/3) ... [2025-03-17 14:32:43,727 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2025-03-17 14:32:43,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:32:43,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-two-queue.wvr.c that has 3 procedures, 41 locations, 1 initial locations, 4 loop locations, and 14 error locations. [2025-03-17 14:32:43,739 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 14:32:43,783 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 14:32:43,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 102 flow [2025-03-17 14:32:43,834 INFO L124 PetriNetUnfolderBase]: 4/42 cut-off events. [2025-03-17 14:32:43,836 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 14:32:43,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 42 events. 4/42 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 91 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-17 14:32:43,841 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 102 flow [2025-03-17 14:32:43,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 41 transitions, 94 flow [2025-03-17 14:32:43,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:32:43,859 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;@72932666, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:32:43,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-17 14:32:43,862 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 14:32:43,862 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-17 14:32:43,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 14:32:43,862 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:43,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:32:43,863 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:43,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 540297, now seen corresponding path program 1 times [2025-03-17 14:32:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:43,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207199807] [2025-03-17 14:32:43,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:43,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:43,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:32:43,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:32:43,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:43,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:44,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207199807] [2025-03-17 14:32:44,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207199807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:44,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:44,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:32:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695502473] [2025-03-17 14:32:44,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:32:44,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:44,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:32:44,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:32:44,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:44,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:44,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:44,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:44,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:44,282 INFO L124 PetriNetUnfolderBase]: 359/589 cut-off events. [2025-03-17 14:32:44,282 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 14:32:44,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 589 events. 359/589 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2759 event pairs, 219 based on Foata normal form. 1/352 useless extension candidates. Maximal degree in co-relation 1090. Up to 544 conditions per place. [2025-03-17 14:32:44,287 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 28 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-17 14:32:44,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 146 flow [2025-03-17 14:32:44,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:32:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:32:44,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-17 14:32:44,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-03-17 14:32:44,297 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 94 flow. Second operand 3 states and 63 transitions. [2025-03-17 14:32:44,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 146 flow [2025-03-17 14:32:44,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 14:32:44,307 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 82 flow [2025-03-17 14:32:44,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-03-17 14:32:44,312 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2025-03-17 14:32:44,312 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 82 flow [2025-03-17 14:32:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:44,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:44,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-17 14:32:44,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:32:44,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:44,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash 540298, now seen corresponding path program 1 times [2025-03-17 14:32:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217175414] [2025-03-17 14:32:44,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:44,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 14:32:44,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 14:32:44,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:44,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:44,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:44,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217175414] [2025-03-17 14:32:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217175414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:44,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:32:44,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692164210] [2025-03-17 14:32:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:44,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:32:44,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:44,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:32:44,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:32:44,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:44,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:44,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:44,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:44,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:44,785 INFO L124 PetriNetUnfolderBase]: 360/592 cut-off events. [2025-03-17 14:32:44,785 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:32:44,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 592 events. 360/592 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2803 event pairs, 219 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 1132. Up to 553 conditions per place. [2025-03-17 14:32:44,791 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 31 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2025-03-17 14:32:44,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 158 flow [2025-03-17 14:32:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:32:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:32:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-17 14:32:44,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-17 14:32:44,795 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 82 flow. Second operand 4 states and 76 transitions. [2025-03-17 14:32:44,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 158 flow [2025-03-17 14:32:44,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:32:44,796 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 105 flow [2025-03-17 14:32:44,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2025-03-17 14:32:44,798 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2025-03-17 14:32:44,798 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 105 flow [2025-03-17 14:32:44,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:44,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:44,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-17 14:32:44,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:32:44,799 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:44,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:44,800 INFO L85 PathProgramCache]: Analyzing trace with hash 16750369, now seen corresponding path program 1 times [2025-03-17 14:32:44,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:44,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908335959] [2025-03-17 14:32:44,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:44,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:44,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:32:44,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:32:44,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:44,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908335959] [2025-03-17 14:32:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908335959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:45,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:45,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:32:45,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382981350] [2025-03-17 14:32:45,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:45,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:32:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:45,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:32:45,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:32:45,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:45,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:45,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:45,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:45,182 INFO L124 PetriNetUnfolderBase]: 361/595 cut-off events. [2025-03-17 14:32:45,182 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:32:45,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 595 events. 361/595 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2811 event pairs, 219 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 1153. Up to 552 conditions per place. [2025-03-17 14:32:45,187 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 31 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2025-03-17 14:32:45,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 187 flow [2025-03-17 14:32:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:32:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:32:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-03-17 14:32:45,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2025-03-17 14:32:45,190 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 105 flow. Second operand 5 states and 89 transitions. [2025-03-17 14:32:45,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 187 flow [2025-03-17 14:32:45,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 184 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:32:45,192 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 139 flow [2025-03-17 14:32:45,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-03-17 14:32:45,192 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-03-17 14:32:45,192 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 139 flow [2025-03-17 14:32:45,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:45,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:45,193 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-17 14:32:45,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:32:45,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:45,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:45,193 INFO L85 PathProgramCache]: Analyzing trace with hash 519243892, now seen corresponding path program 1 times [2025-03-17 14:32:45,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:45,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854617373] [2025-03-17 14:32:45,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:45,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:45,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:32:45,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:32:45,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:45,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854617373] [2025-03-17 14:32:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854617373] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:32:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325238820] [2025-03-17 14:32:45,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:45,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:45,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:32:45,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:32:45,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:32:45,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:32:45,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:32:45,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:45,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:45,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:32:45,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:32:45,479 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-17 14:32:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:45,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:32:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:45,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325238820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:32:45,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:32:45,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-17 14:32:45,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351145000] [2025-03-17 14:32:45,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:32:45,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 14:32:45,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:45,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 14:32:45,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-17 14:32:45,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:45,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 139 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:45,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:45,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:45,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:46,086 INFO L124 PetriNetUnfolderBase]: 361/594 cut-off events. [2025-03-17 14:32:46,086 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:32:46,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 594 events. 361/594 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2820 event pairs, 219 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 1163. Up to 552 conditions per place. [2025-03-17 14:32:46,090 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 30 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2025-03-17 14:32:46,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 209 flow [2025-03-17 14:32:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:32:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 14:32:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2025-03-17 14:32:46,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2025-03-17 14:32:46,091 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 139 flow. Second operand 6 states and 95 transitions. [2025-03-17 14:32:46,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 209 flow [2025-03-17 14:32:46,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:32:46,094 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 148 flow [2025-03-17 14:32:46,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-03-17 14:32:46,095 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-03-17 14:32:46,095 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 148 flow [2025-03-17 14:32:46,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:46,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:46,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-17 14:32:46,106 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-17 14:32:46,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:46,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1082747138, now seen corresponding path program 1 times [2025-03-17 14:32:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:46,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355090033] [2025-03-17 14:32:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:46,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:46,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:32:46,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:32:46,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:46,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:46,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:46,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355090033] [2025-03-17 14:32:46,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355090033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:32:46,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054256898] [2025-03-17 14:32:46,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:46,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:46,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:32:46,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:32:46,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:32:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:32:46,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:32:46,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:46,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:46,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 14:32:46,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:32:46,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:32:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:46,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:32:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:46,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054256898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:32:46,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:32:46,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-17 14:32:46,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875862172] [2025-03-17 14:32:46,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:32:46,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 14:32:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:46,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 14:32:46,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 14:32:46,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:46,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 148 flow. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:46,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:46,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:46,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:47,215 INFO L124 PetriNetUnfolderBase]: 363/599 cut-off events. [2025-03-17 14:32:47,215 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 14:32:47,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 599 events. 363/599 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2846 event pairs, 219 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1171. Up to 545 conditions per place. [2025-03-17 14:32:47,218 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 24 selfloop transitions, 18 changer transitions 0/47 dead transitions. [2025-03-17 14:32:47,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 261 flow [2025-03-17 14:32:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 14:32:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 14:32:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2025-03-17 14:32:47,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3383838383838384 [2025-03-17 14:32:47,220 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 148 flow. Second operand 9 states and 134 transitions. [2025-03-17 14:32:47,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 261 flow [2025-03-17 14:32:47,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 214 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-17 14:32:47,222 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 166 flow [2025-03-17 14:32:47,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2025-03-17 14:32:47,222 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-03-17 14:32:47,222 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 166 flow [2025-03-17 14:32:47,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:47,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:47,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:47,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:32:47,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:47,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:47,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash 796676042, now seen corresponding path program 1 times [2025-03-17 14:32:47,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:47,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111121190] [2025-03-17 14:32:47,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:47,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:47,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:32:47,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:32:47,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:47,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:47,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111121190] [2025-03-17 14:32:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111121190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:47,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:32:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147507143] [2025-03-17 14:32:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:47,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:32:47,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:47,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:32:47,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:32:47,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:47,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:47,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:47,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:47,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:47,586 INFO L124 PetriNetUnfolderBase]: 285/482 cut-off events. [2025-03-17 14:32:47,586 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-17 14:32:47,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 482 events. 285/482 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2176 event pairs, 171 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 910. Up to 431 conditions per place. [2025-03-17 14:32:47,588 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 36 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-17 14:32:47,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 242 flow [2025-03-17 14:32:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:32:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:32:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-03-17 14:32:47,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2025-03-17 14:32:47,590 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 166 flow. Second operand 4 states and 70 transitions. [2025-03-17 14:32:47,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 242 flow [2025-03-17 14:32:47,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 209 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-17 14:32:47,591 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 137 flow [2025-03-17 14:32:47,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2025-03-17 14:32:47,592 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-03-17 14:32:47,592 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 137 flow [2025-03-17 14:32:47,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:47,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:47,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:47,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:32:47,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:47,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 796676043, now seen corresponding path program 1 times [2025-03-17 14:32:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541057596] [2025-03-17 14:32:47,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:47,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:32:47,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:32:47,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:47,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:32:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541057596] [2025-03-17 14:32:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541057596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:47,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:47,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:32:47,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896005981] [2025-03-17 14:32:47,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:47,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:32:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:47,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:32:47,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:32:47,653 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-17 14:32:47,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:47,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:47,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-17 14:32:47,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:47,750 INFO L124 PetriNetUnfolderBase]: 307/543 cut-off events. [2025-03-17 14:32:47,750 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-17 14:32:47,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 543 events. 307/543 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2562 event pairs, 194 based on Foata normal form. 16/389 useless extension candidates. Maximal degree in co-relation 900. Up to 443 conditions per place. [2025-03-17 14:32:47,755 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 46 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2025-03-17 14:32:47,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 269 flow [2025-03-17 14:32:47,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:32:47,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:32:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-03-17 14:32:47,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5397727272727273 [2025-03-17 14:32:47,757 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 137 flow. Second operand 4 states and 95 transitions. [2025-03-17 14:32:47,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 269 flow [2025-03-17 14:32:47,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:32:47,758 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 151 flow [2025-03-17 14:32:47,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2025-03-17 14:32:47,759 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2025-03-17 14:32:47,759 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 151 flow [2025-03-17 14:32:47,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:47,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:47,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:47,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:32:47,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1063329590, now seen corresponding path program 1 times [2025-03-17 14:32:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076011997] [2025-03-17 14:32:47,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:47,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:47,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:32:47,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:32:47,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:47,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:47,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076011997] [2025-03-17 14:32:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076011997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:47,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:32:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458676180] [2025-03-17 14:32:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:47,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:32:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:32:47,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:32:47,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-17 14:32:47,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:47,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:47,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-17 14:32:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:47,919 INFO L124 PetriNetUnfolderBase]: 336/642 cut-off events. [2025-03-17 14:32:47,919 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-17 14:32:47,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 642 events. 336/642 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3362 event pairs, 222 based on Foata normal form. 12/472 useless extension candidates. Maximal degree in co-relation 1022. Up to 499 conditions per place. [2025-03-17 14:32:47,924 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 54 selfloop transitions, 5 changer transitions 1/65 dead transitions. [2025-03-17 14:32:47,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 345 flow [2025-03-17 14:32:47,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:32:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:32:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-17 14:32:47,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2025-03-17 14:32:47,926 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 151 flow. Second operand 5 states and 114 transitions. [2025-03-17 14:32:47,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 345 flow [2025-03-17 14:32:47,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 14:32:47,930 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 191 flow [2025-03-17 14:32:47,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-03-17 14:32:47,931 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-03-17 14:32:47,931 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 191 flow [2025-03-17 14:32:47,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:47,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:47,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:47,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:32:47,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -912955698, now seen corresponding path program 1 times [2025-03-17 14:32:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984732588] [2025-03-17 14:32:47,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:47,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 14:32:47,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 14:32:47,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:47,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:32:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984732588] [2025-03-17 14:32:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984732588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:48,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:32:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183419] [2025-03-17 14:32:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:48,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:32:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:48,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:32:48,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:32:48,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-17 14:32:48,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:48,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:48,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-17 14:32:48,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:48,242 INFO L124 PetriNetUnfolderBase]: 262/525 cut-off events. [2025-03-17 14:32:48,242 INFO L125 PetriNetUnfolderBase]: For 97/145 co-relation queries the response was YES. [2025-03-17 14:32:48,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1258 conditions, 525 events. 262/525 cut-off events. For 97/145 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2677 event pairs, 174 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 1053. Up to 448 conditions per place. [2025-03-17 14:32:48,244 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 33 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2025-03-17 14:32:48,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 263 flow [2025-03-17 14:32:48,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:32:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:32:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-17 14:32:48,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-17 14:32:48,245 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 191 flow. Second operand 4 states and 76 transitions. [2025-03-17 14:32:48,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 263 flow [2025-03-17 14:32:48,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:32:48,248 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 192 flow [2025-03-17 14:32:48,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-03-17 14:32:48,249 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-03-17 14:32:48,250 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 192 flow [2025-03-17 14:32:48,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:48,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:48,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:48,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 14:32:48,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:48,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:48,251 INFO L85 PathProgramCache]: Analyzing trace with hash 633557408, now seen corresponding path program 1 times [2025-03-17 14:32:48,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:48,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808685327] [2025-03-17 14:32:48,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:48,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:48,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:32:48,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:32:48,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:48,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:32:48,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808685327] [2025-03-17 14:32:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808685327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:32:48,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736305049] [2025-03-17 14:32:48,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:48,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:48,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:32:48,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:32:48,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:32:48,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:32:48,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:32:48,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:48,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:48,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 14:32:48,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:32:48,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:32:48,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:32:48,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-17 14:32:48,530 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:32:48,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:32:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:32:48,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:32:48,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736305049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:48,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:32:48,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2025-03-17 14:32:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586298756] [2025-03-17 14:32:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:48,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:32:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:48,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:32:48,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:32:48,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:48,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:48,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:48,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:48,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:48,647 INFO L124 PetriNetUnfolderBase]: 198/423 cut-off events. [2025-03-17 14:32:48,647 INFO L125 PetriNetUnfolderBase]: For 87/111 co-relation queries the response was YES. [2025-03-17 14:32:48,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 423 events. 198/423 cut-off events. For 87/111 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2084 event pairs, 132 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 648. Up to 365 conditions per place. [2025-03-17 14:32:48,649 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions. [2025-03-17 14:32:48,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 260 flow [2025-03-17 14:32:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:32:48,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 14:32:48,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-03-17 14:32:48,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-17 14:32:48,650 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 192 flow. Second operand 4 states and 66 transitions. [2025-03-17 14:32:48,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 260 flow [2025-03-17 14:32:48,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:32:48,651 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 182 flow [2025-03-17 14:32:48,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2025-03-17 14:32:48,651 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-03-17 14:32:48,651 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 182 flow [2025-03-17 14:32:48,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:48,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:48,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:48,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:32:48,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:48,852 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:48,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 633557407, now seen corresponding path program 1 times [2025-03-17 14:32:48,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:48,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915276347] [2025-03-17 14:32:48,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:48,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:48,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:32:48,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:32:48,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:48,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:32:48,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915276347] [2025-03-17 14:32:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915276347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:32:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528046326] [2025-03-17 14:32:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:48,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:32:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:48,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:32:48,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:32:48,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:32:48,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:48,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:48,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:32:48,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:48,974 INFO L124 PetriNetUnfolderBase]: 144/335 cut-off events. [2025-03-17 14:32:48,974 INFO L125 PetriNetUnfolderBase]: For 75/83 co-relation queries the response was YES. [2025-03-17 14:32:48,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 335 events. 144/335 cut-off events. For 75/83 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1601 event pairs, 96 based on Foata normal form. 0/310 useless extension candidates. Maximal degree in co-relation 544. Up to 266 conditions per place. [2025-03-17 14:32:48,976 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 28 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2025-03-17 14:32:48,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 246 flow [2025-03-17 14:32:48,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 14:32:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 14:32:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-17 14:32:48,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2025-03-17 14:32:48,978 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 182 flow. Second operand 5 states and 74 transitions. [2025-03-17 14:32:48,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 246 flow [2025-03-17 14:32:48,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 14:32:48,980 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 185 flow [2025-03-17 14:32:48,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-03-17 14:32:48,981 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-03-17 14:32:48,981 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 185 flow [2025-03-17 14:32:48,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:48,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:48,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:48,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:32:48,981 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:48,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1669966763, now seen corresponding path program 1 times [2025-03-17 14:32:48,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:48,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467662685] [2025-03-17 14:32:48,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:48,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:48,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:32:48,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:32:48,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:48,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:32:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467662685] [2025-03-17 14:32:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467662685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:49,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:32:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681968977] [2025-03-17 14:32:49,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:49,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:32:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:49,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:32:49,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:32:49,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-17 14:32:49,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:49,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:49,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-17 14:32:49,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:49,101 INFO L124 PetriNetUnfolderBase]: 180/397 cut-off events. [2025-03-17 14:32:49,102 INFO L125 PetriNetUnfolderBase]: For 93/101 co-relation queries the response was YES. [2025-03-17 14:32:49,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 397 events. 180/397 cut-off events. For 93/101 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1935 event pairs, 61 based on Foata normal form. 4/381 useless extension candidates. Maximal degree in co-relation 708. Up to 181 conditions per place. [2025-03-17 14:32:49,103 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 39 selfloop transitions, 3 changer transitions 5/52 dead transitions. [2025-03-17 14:32:49,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 312 flow [2025-03-17 14:32:49,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:32:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:32:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-17 14:32:49,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2025-03-17 14:32:49,104 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 185 flow. Second operand 3 states and 70 transitions. [2025-03-17 14:32:49,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 312 flow [2025-03-17 14:32:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 300 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-17 14:32:49,105 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 155 flow [2025-03-17 14:32:49,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2025-03-17 14:32:49,106 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-03-17 14:32:49,106 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 155 flow [2025-03-17 14:32:49,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:49,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:49,106 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:49,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:32:49,107 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:49,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1967294551, now seen corresponding path program 1 times [2025-03-17 14:32:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234100035] [2025-03-17 14:32:49,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:49,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:49,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:32:49,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:32:49,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:49,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:32:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234100035] [2025-03-17 14:32:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234100035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:49,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:49,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:32:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509720249] [2025-03-17 14:32:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:49,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:32:49,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:49,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:32:49,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:32:49,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-17 14:32:49,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:49,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:49,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-17 14:32:49,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:49,190 INFO L124 PetriNetUnfolderBase]: 107/218 cut-off events. [2025-03-17 14:32:49,190 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-03-17 14:32:49,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 218 events. 107/218 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 749 event pairs, 22 based on Foata normal form. 6/212 useless extension candidates. Maximal degree in co-relation 521. Up to 143 conditions per place. [2025-03-17 14:32:49,191 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2025-03-17 14:32:49,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 257 flow [2025-03-17 14:32:49,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:32:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:32:49,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-17 14:32:49,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-17 14:32:49,192 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 155 flow. Second operand 3 states and 66 transitions. [2025-03-17 14:32:49,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 257 flow [2025-03-17 14:32:49,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 252 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 14:32:49,193 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 164 flow [2025-03-17 14:32:49,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2025-03-17 14:32:49,194 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2025-03-17 14:32:49,194 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 164 flow [2025-03-17 14:32:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:49,194 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:49,195 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:49,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:32:49,195 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:49,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:49,195 INFO L85 PathProgramCache]: Analyzing trace with hash -833629337, now seen corresponding path program 1 times [2025-03-17 14:32:49,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:49,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960632196] [2025-03-17 14:32:49,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:49,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:49,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 14:32:49,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 14:32:49,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:49,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:32:49,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960632196] [2025-03-17 14:32:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960632196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:32:49,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:32:49,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:32:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201395460] [2025-03-17 14:32:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:32:49,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:32:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:49,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:32:49,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:32:49,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2025-03-17 14:32:49,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:49,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:49,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2025-03-17 14:32:49,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:32:49,275 INFO L124 PetriNetUnfolderBase]: 82/178 cut-off events. [2025-03-17 14:32:49,275 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-17 14:32:49,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 178 events. 82/178 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 502 event pairs, 27 based on Foata normal form. 5/173 useless extension candidates. Maximal degree in co-relation 439. Up to 112 conditions per place. [2025-03-17 14:32:49,276 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 38 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2025-03-17 14:32:49,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 280 flow [2025-03-17 14:32:49,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:32:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 14:32:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-03-17 14:32:49,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-17 14:32:49,279 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 164 flow. Second operand 3 states and 68 transitions. [2025-03-17 14:32:49,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 280 flow [2025-03-17 14:32:49,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 273 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-17 14:32:49,280 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 174 flow [2025-03-17 14:32:49,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-03-17 14:32:49,280 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-03-17 14:32:49,280 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 174 flow [2025-03-17 14:32:49,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:49,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:32:49,281 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:32:49,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:32:49,281 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:32:49,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:32:49,281 INFO L85 PathProgramCache]: Analyzing trace with hash -317011860, now seen corresponding path program 1 times [2025-03-17 14:32:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:32:49,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095444501] [2025-03-17 14:32:49,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:49,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:32:49,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:32:49,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:32:49,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:49,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:32:50,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:32:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095444501] [2025-03-17 14:32:50,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095444501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:32:50,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003956279] [2025-03-17 14:32:50,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:32:50,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:32:50,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:32:50,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:32:50,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:32:50,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 14:32:50,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:32:50,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:32:50,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:32:50,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 14:32:50,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:32:50,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:32:50,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:32:50,604 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:32:50,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:32:50,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:32:51,118 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2025-03-17 14:32:51,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 20 [2025-03-17 14:32:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:32:51,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:32:52,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:32:52,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 73 [2025-03-17 14:32:52,596 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-03-17 14:32:52,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 183 [2025-03-17 14:32:52,642 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:32:52,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 133 [2025-03-17 14:32:54,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:32:54,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 73 [2025-03-17 14:32:55,022 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2025-03-17 14:32:55,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 182 [2025-03-17 14:32:55,035 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 14:32:55,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:32:55,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 125 [2025-03-17 14:32:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:32:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003956279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:32:56,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:32:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 41 [2025-03-17 14:32:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978694190] [2025-03-17 14:32:56,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:32:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 14:32:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:32:56,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 14:32:56,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1561, Unknown=2, NotChecked=0, Total=1722 [2025-03-17 14:32:56,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2025-03-17 14:32:56,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 174 flow. Second operand has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:32:56,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:32:56,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2025-03-17 14:32:56,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:04,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-17 14:33:06,602 INFO L124 PetriNetUnfolderBase]: 636/1178 cut-off events. [2025-03-17 14:33:06,602 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2025-03-17 14:33:06,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3202 conditions, 1178 events. 636/1178 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5708 event pairs, 45 based on Foata normal form. 3/1020 useless extension candidates. Maximal degree in co-relation 2905. Up to 218 conditions per place. [2025-03-17 14:33:06,607 INFO L140 encePairwiseOnDemand]: 26/44 looper letters, 139 selfloop transitions, 123 changer transitions 35/300 dead transitions. [2025-03-17 14:33:06,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 300 transitions, 1676 flow [2025-03-17 14:33:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-17 14:33:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-03-17 14:33:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 569 transitions. [2025-03-17 14:33:06,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23947811447811448 [2025-03-17 14:33:06,611 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 174 flow. Second operand 54 states and 569 transitions. [2025-03-17 14:33:06,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 300 transitions, 1676 flow [2025-03-17 14:33:06,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 300 transitions, 1651 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-17 14:33:06,616 INFO L231 Difference]: Finished difference. Result has 134 places, 159 transitions, 1230 flow [2025-03-17 14:33:06,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1230, PETRI_PLACES=134, PETRI_TRANSITIONS=159} [2025-03-17 14:33:06,617 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 90 predicate places. [2025-03-17 14:33:06,617 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 159 transitions, 1230 flow [2025-03-17 14:33:06,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 6.642857142857143) internal successors, (279), 42 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:06,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:06,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:06,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:33:06,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:33:06,819 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:33:06,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:06,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1237277930, now seen corresponding path program 2 times [2025-03-17 14:33:06,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:06,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114165820] [2025-03-17 14:33:06,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:06,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:06,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:33:06,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:33:06,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:33:06,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:07,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:07,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114165820] [2025-03-17 14:33:07,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114165820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:07,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928559071] [2025-03-17 14:33:07,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:33:07,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:07,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:07,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:33:07,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:33:07,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:33:07,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:33:07,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:33:07,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:07,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 14:33:07,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:33:08,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:08,490 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2025-03-17 14:33:08,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 105 [2025-03-17 14:33:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:33:08,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928559071] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:08,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:08,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2025-03-17 14:33:08,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800374032] [2025-03-17 14:33:08,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:08,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 14:33:08,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:08,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 14:33:08,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1320, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 14:33:09,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2025-03-17 14:33:09,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 159 transitions, 1230 flow. Second operand has 39 states, 39 states have (on average 11.76923076923077) internal successors, (459), 39 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:09,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:09,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2025-03-17 14:33:09,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:11,620 INFO L124 PetriNetUnfolderBase]: 956/1752 cut-off events. [2025-03-17 14:33:11,621 INFO L125 PetriNetUnfolderBase]: For 16196/16196 co-relation queries the response was YES. [2025-03-17 14:33:11,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9160 conditions, 1752 events. 956/1752 cut-off events. For 16196/16196 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9515 event pairs, 65 based on Foata normal form. 25/1773 useless extension candidates. Maximal degree in co-relation 8922. Up to 433 conditions per place. [2025-03-17 14:33:11,633 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 216 selfloop transitions, 177 changer transitions 21/417 dead transitions. [2025-03-17 14:33:11,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 417 transitions, 4038 flow [2025-03-17 14:33:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-17 14:33:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-17 14:33:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 724 transitions. [2025-03-17 14:33:11,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35009671179883944 [2025-03-17 14:33:11,635 INFO L175 Difference]: Start difference. First operand has 134 places, 159 transitions, 1230 flow. Second operand 47 states and 724 transitions. [2025-03-17 14:33:11,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 417 transitions, 4038 flow [2025-03-17 14:33:11,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 417 transitions, 3756 flow, removed 140 selfloop flow, removed 2 redundant places. [2025-03-17 14:33:11,681 INFO L231 Difference]: Finished difference. Result has 185 places, 271 transitions, 2535 flow [2025-03-17 14:33:11,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2535, PETRI_PLACES=185, PETRI_TRANSITIONS=271} [2025-03-17 14:33:11,683 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 141 predicate places. [2025-03-17 14:33:11,683 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 271 transitions, 2535 flow [2025-03-17 14:33:11,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 11.76923076923077) internal successors, (459), 39 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:11,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:11,685 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:11,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:33:11,885 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,SelfDestructingSolverStorable15 [2025-03-17 14:33:11,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:33:11,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash 814477418, now seen corresponding path program 3 times [2025-03-17 14:33:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063605732] [2025-03-17 14:33:11,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:33:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:11,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-17 14:33:11,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-17 14:33:11,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:33:11,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063605732] [2025-03-17 14:33:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063605732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697399374] [2025-03-17 14:33:12,669 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:33:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:12,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:33:12,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:33:12,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-17 14:33:12,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 27 statements. [2025-03-17 14:33:12,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 14:33:12,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:12,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 14:33:12,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:12,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:33:12,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:33:12,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:33:12,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:33:12,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 14:33:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:33:13,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:14,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:33:14,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 62 [2025-03-17 14:33:14,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:33:14,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 87 [2025-03-17 14:33:14,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:33:14,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 127 [2025-03-17 14:33:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697399374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:14,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:14,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 38 [2025-03-17 14:33:14,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217733311] [2025-03-17 14:33:14,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:14,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 14:33:14,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:14,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 14:33:14,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1316, Unknown=5, NotChecked=0, Total=1482 [2025-03-17 14:33:15,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 44 [2025-03-17 14:33:15,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 271 transitions, 2535 flow. Second operand has 39 states, 39 states have (on average 6.794871794871795) internal successors, (265), 39 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:15,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:15,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 44 [2025-03-17 14:33:15,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:19,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:33:24,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:33:29,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 14:33:38,715 INFO L124 PetriNetUnfolderBase]: 1808/3296 cut-off events. [2025-03-17 14:33:38,715 INFO L125 PetriNetUnfolderBase]: For 48765/48765 co-relation queries the response was YES. [2025-03-17 14:33:38,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20981 conditions, 3296 events. 1808/3296 cut-off events. For 48765/48765 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 20653 event pairs, 103 based on Foata normal form. 37/3329 useless extension candidates. Maximal degree in co-relation 20658. Up to 1469 conditions per place. [2025-03-17 14:33:38,744 INFO L140 encePairwiseOnDemand]: 26/44 looper letters, 398 selfloop transitions, 350 changer transitions 57/808 dead transitions. [2025-03-17 14:33:38,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 808 transitions, 9694 flow [2025-03-17 14:33:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-17 14:33:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2025-03-17 14:33:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 901 transitions. [2025-03-17 14:33:38,748 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21555023923444977 [2025-03-17 14:33:38,748 INFO L175 Difference]: Start difference. First operand has 185 places, 271 transitions, 2535 flow. Second operand 95 states and 901 transitions. [2025-03-17 14:33:38,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 808 transitions, 9694 flow [2025-03-17 14:33:38,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 808 transitions, 8951 flow, removed 331 selfloop flow, removed 14 redundant places. [2025-03-17 14:33:38,894 INFO L231 Difference]: Finished difference. Result has 302 places, 574 transitions, 6772 flow [2025-03-17 14:33:38,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=95, PETRI_FLOW=6772, PETRI_PLACES=302, PETRI_TRANSITIONS=574} [2025-03-17 14:33:38,895 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 258 predicate places. [2025-03-17 14:33:38,895 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 574 transitions, 6772 flow [2025-03-17 14:33:38,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 6.794871794871795) internal successors, (265), 39 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:38,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:33:38,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:33:38,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 14:33:39,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:33:39,096 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:33:39,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:33:39,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2145724616, now seen corresponding path program 4 times [2025-03-17 14:33:39,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:33:39,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942441853] [2025-03-17 14:33:39,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:33:39,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:33:39,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:33:39,129 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:33:39,129 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:33:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:33:40,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:33:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942441853] [2025-03-17 14:33:40,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942441853] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:33:40,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383112206] [2025-03-17 14:33:40,701 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:33:40,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:33:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:33:40,703 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:33:40,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:33:40,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-17 14:33:40,778 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:33:40,779 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:33:40,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:33:40,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 14:33:40,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:33:40,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:33:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:33:41,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:33:42,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:33:42,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 297 [2025-03-17 14:33:42,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:33:42,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2025-03-17 14:33:42,637 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 14:33:42,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2025-03-17 14:33:42,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:33:42,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 14:33:42,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:33:42,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-17 14:33:42,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:33:42,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-03-17 14:33:42,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:33:42,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-17 14:33:42,721 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 14:33:42,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 1 [2025-03-17 14:33:42,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 14:33:42,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-17 14:33:42,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:33:42,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 103 [2025-03-17 14:33:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 14:33:43,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383112206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:33:43,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:33:43,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2025-03-17 14:33:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21279280] [2025-03-17 14:33:43,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:33:43,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-17 14:33:43,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:33:43,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-17 14:33:43,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1332, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 14:33:43,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44 [2025-03-17 14:33:43,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 574 transitions, 6772 flow. Second operand has 39 states, 39 states have (on average 9.76923076923077) internal successors, (381), 39 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:33:43,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 14:33:43,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44 [2025-03-17 14:33:43,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 14:33:49,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-17 14:33:53,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-17 14:33:58,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-17 14:34:02,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-17 14:34:03,653 INFO L124 PetriNetUnfolderBase]: 2333/4233 cut-off events. [2025-03-17 14:34:03,653 INFO L125 PetriNetUnfolderBase]: For 110485/110485 co-relation queries the response was YES. [2025-03-17 14:34:03,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32023 conditions, 4233 events. 2333/4233 cut-off events. For 110485/110485 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 27985 event pairs, 130 based on Foata normal form. 27/4256 useless extension candidates. Maximal degree in co-relation 31523. Up to 1517 conditions per place. [2025-03-17 14:34:03,699 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 380 selfloop transitions, 552 changer transitions 30/965 dead transitions. [2025-03-17 14:34:03,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 965 transitions, 13497 flow [2025-03-17 14:34:03,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-17 14:34:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-17 14:34:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 791 transitions. [2025-03-17 14:34:03,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2996212121212121 [2025-03-17 14:34:03,702 INFO L175 Difference]: Start difference. First operand has 302 places, 574 transitions, 6772 flow. Second operand 60 states and 791 transitions. [2025-03-17 14:34:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 965 transitions, 13497 flow [2025-03-17 14:34:04,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 965 transitions, 12322 flow, removed 554 selfloop flow, removed 16 redundant places. [2025-03-17 14:34:04,223 INFO L231 Difference]: Finished difference. Result has 356 places, 773 transitions, 10604 flow [2025-03-17 14:34:04,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=6037, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=372, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=10604, PETRI_PLACES=356, PETRI_TRANSITIONS=773} [2025-03-17 14:34:04,224 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 312 predicate places. [2025-03-17 14:34:04,224 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 773 transitions, 10604 flow [2025-03-17 14:34:04,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 9.76923076923077) internal successors, (381), 39 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:34:04,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 14:34:04,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:34:04,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:34:04,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:04,425 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2025-03-17 14:34:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:34:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash 987600942, now seen corresponding path program 5 times [2025-03-17 14:34:04,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:34:04,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57382225] [2025-03-17 14:34:04,426 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:34:04,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:34:04,433 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-17 14:34:04,449 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:34:04,449 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:34:04,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:34:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57382225] [2025-03-17 14:34:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57382225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:34:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709641450] [2025-03-17 14:34:05,246 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:34:05,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:34:05,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:34:05,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:34:05,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:34:05,289 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 3 equivalence classes. [2025-03-17 14:34:05,306 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 14:34:05,306 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-17 14:34:05,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:34:05,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 14:34:05,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:34:05,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 14:34:05,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:34:05,446 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 14:34:05,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 14:34:05,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-17 14:34:05,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-03-17 14:34:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:34:06,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:34:11,944 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-03-17 14:34:11,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 228 treesize of output 254 [2025-03-17 14:34:11,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:34:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 186 [2025-03-17 14:34:12,103 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 14:34:12,108 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 9 treesize of output 3 [2025-03-17 14:34:12,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:34:12,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 189 treesize of output 231 [2025-03-17 14:34:13,574 INFO L349 Elim1Store]: treesize reduction 32, result has 63.2 percent of original size [2025-03-17 14:34:13,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 298 [2025-03-17 14:34:13,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:34:13,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 223 [2025-03-17 14:34:13,727 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 20 treesize of output 14 [2025-03-17 14:34:13,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 14:34:13,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 184