./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:30:48,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:30:48,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:30:48,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:30:48,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:30:48,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:30:48,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:30:48,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:30:48,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:30:48,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:30:48,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:30:48,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:30:48,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:30:48,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:30:48,873 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:30:48,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:30:48,873 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:30:48,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:30:48,874 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:48,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:30:48,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:30:48,875 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:30:48,875 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:30:48,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:30:48,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:30:48,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9fb4c28a8a216c266c6ae14d377c8e26c68bb16bf7c2fe2809f039d12d6c4b55 [2025-03-09 01:30:49,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:30:49,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:30:49,088 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:30:49,089 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:30:49,089 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:30:49,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-09 01:30:50,198 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e25d583/f1f0583055f847a6bd7198d0702a3bf2/FLAG450d21b20 [2025-03-09 01:30:50,383 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:30:50,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2025-03-09 01:30:50,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e25d583/f1f0583055f847a6bd7198d0702a3bf2/FLAG450d21b20 [2025-03-09 01:30:50,765 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e25d583/f1f0583055f847a6bd7198d0702a3bf2 [2025-03-09 01:30:50,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:30:50,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:30:50,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:50,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:30:50,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:30:50,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:50,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c7bd438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50, skipping insertion in model container [2025-03-09 01:30:50,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:50,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:30:50,916 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:30:50,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:50,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:30:50,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:30:50,969 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:30:50,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50 WrapperNode [2025-03-09 01:30:50,970 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:30:50,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:50,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:30:50,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:30:50,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:50,987 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,008 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 148 [2025-03-09 01:30:51,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:30:51,010 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:30:51,010 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:30:51,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:30:51,016 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,031 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-03-09 01:30:51,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,039 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:30:51,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:30:51,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:30:51,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:30:51,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (1/1) ... [2025-03-09 01:30:51,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:30:51,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:51,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:30:51,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:30:51,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:30:51,105 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:30:51,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:30:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:30:51,106 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:30:51,177 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:30:51,178 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:30:51,465 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:30:51,465 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:30:51,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:30:51,635 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:30:51,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:51 BoogieIcfgContainer [2025-03-09 01:30:51,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:30:51,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:30:51,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:30:51,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:30:51,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:30:50" (1/3) ... [2025-03-09 01:30:51,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52069cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:51, skipping insertion in model container [2025-03-09 01:30:51,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:30:50" (2/3) ... [2025-03-09 01:30:51,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52069cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:30:51, skipping insertion in model container [2025-03-09 01:30:51,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:30:51" (3/3) ... [2025-03-09 01:30:51,645 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2025-03-09 01:30:51,655 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:30:51,656 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-3.wvr.c that has 3 procedures, 44 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-09 01:30:51,656 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:30:51,709 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:30:51,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 48 transitions, 110 flow [2025-03-09 01:30:51,761 INFO L124 PetriNetUnfolderBase]: 5/46 cut-off events. [2025-03-09 01:30:51,763 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:30:51,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 46 events. 5/46 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-09 01:30:51,768 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 48 transitions, 110 flow [2025-03-09 01:30:51,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 45 transitions, 102 flow [2025-03-09 01:30:51,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:30:51,787 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;@436ebd76, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:30:51,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-09 01:30:51,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:30:51,793 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:30:51,793 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:30:51,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:51,794 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:51,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:51,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 442539, now seen corresponding path program 1 times [2025-03-09 01:30:51,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:51,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658679422] [2025-03-09 01:30:51,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:51,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:51,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:51,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:51,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:51,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:51,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:51,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658679422] [2025-03-09 01:30:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658679422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:51,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:30:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045779990] [2025-03-09 01:30:51,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:51,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:52,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:52,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:52,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-09 01:30:52,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:52,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:52,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-09 01:30:52,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:52,191 INFO L124 PetriNetUnfolderBase]: 147/328 cut-off events. [2025-03-09 01:30:52,191 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-09 01:30:52,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 328 events. 147/328 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1619 event pairs, 94 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 510. Up to 235 conditions per place. [2025-03-09 01:30:52,199 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 23 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2025-03-09 01:30:52,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 146 flow [2025-03-09 01:30:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-09 01:30:52,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-09 01:30:52,210 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 102 flow. Second operand 3 states and 87 transitions. [2025-03-09 01:30:52,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 146 flow [2025-03-09 01:30:52,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:52,216 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 92 flow [2025-03-09 01:30:52,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2025-03-09 01:30:52,221 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2025-03-09 01:30:52,221 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 92 flow [2025-03-09 01:30:52,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:52,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:52,221 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:30:52,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:30:52,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:52,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash 442540, now seen corresponding path program 1 times [2025-03-09 01:30:52,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:52,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203142666] [2025-03-09 01:30:52,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:52,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:52,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:30:52,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:30:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:52,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:52,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203142666] [2025-03-09 01:30:52,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203142666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:52,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:52,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:52,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441506463] [2025-03-09 01:30:52,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:52,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:52,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:52,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:52,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:52,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-09 01:30:52,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:52,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:52,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-09 01:30:52,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:52,602 INFO L124 PetriNetUnfolderBase]: 148/331 cut-off events. [2025-03-09 01:30:52,602 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:30:52,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 331 events. 148/331 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1643 event pairs, 94 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 561. Up to 240 conditions per place. [2025-03-09 01:30:52,605 INFO L140 encePairwiseOnDemand]: 44/48 looper letters, 26 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-03-09 01:30:52,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 158 flow [2025-03-09 01:30:52,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2025-03-09 01:30:52,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-09 01:30:52,609 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 92 flow. Second operand 3 states and 90 transitions. [2025-03-09 01:30:52,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 158 flow [2025-03-09 01:30:52,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:52,610 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 107 flow [2025-03-09 01:30:52,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2025-03-09 01:30:52,611 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-03-09 01:30:52,611 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 107 flow [2025-03-09 01:30:52,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:52,611 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:52,611 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:30:52,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:30:52,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 425294874, now seen corresponding path program 1 times [2025-03-09 01:30:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:52,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997528140] [2025-03-09 01:30:52,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:52,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:52,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:52,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:52,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:52,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:52,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997528140] [2025-03-09 01:30:52,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997528140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:52,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481325659] [2025-03-09 01:30:52,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:52,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:52,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:52,886 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:52,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:30:52,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:30:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:30:52,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:52,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:52,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:52,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:52,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-09 01:30:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:53,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481325659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:53,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:30:53,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934096331] [2025-03-09 01:30:53,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:53,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:30:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:30:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:30:53,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-09 01:30:53,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 107 flow. Second operand has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:53,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:53,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-09 01:30:53,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:53,606 INFO L124 PetriNetUnfolderBase]: 148/330 cut-off events. [2025-03-09 01:30:53,607 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:30:53,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 330 events. 148/330 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1625 event pairs, 94 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 561. Up to 236 conditions per place. [2025-03-09 01:30:53,610 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 22 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2025-03-09 01:30:53,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 161 flow [2025-03-09 01:30:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-09 01:30:53,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5375 [2025-03-09 01:30:53,612 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 107 flow. Second operand 5 states and 129 transitions. [2025-03-09 01:30:53,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 161 flow [2025-03-09 01:30:53,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:53,613 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 120 flow [2025-03-09 01:30:53,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2025-03-09 01:30:53,613 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2025-03-09 01:30:53,614 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 120 flow [2025-03-09 01:30:53,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.363636363636363) internal successors, (235), 11 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:53,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:53,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:30:53,621 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-09 01:30:53,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:53,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:53,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash 301776473, now seen corresponding path program 1 times [2025-03-09 01:30:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:53,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364740667] [2025-03-09 01:30:53,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:53,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:30:53,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:30:53,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:53,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:53,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:53,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364740667] [2025-03-09 01:30:53,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364740667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:30:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683257809] [2025-03-09 01:30:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:53,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:30:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:53,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:30:53,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:30:53,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-03-09 01:30:53,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:53,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:53,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-03-09 01:30:53,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:53,923 INFO L124 PetriNetUnfolderBase]: 147/329 cut-off events. [2025-03-09 01:30:53,923 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:30:53,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 329 events. 147/329 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1622 event pairs, 94 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 561. Up to 238 conditions per place. [2025-03-09 01:30:53,925 INFO L140 encePairwiseOnDemand]: 45/48 looper letters, 25 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2025-03-09 01:30:53,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 43 transitions, 168 flow [2025-03-09 01:30:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:30:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:30:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2025-03-09 01:30:53,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6319444444444444 [2025-03-09 01:30:53,928 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 120 flow. Second operand 3 states and 91 transitions. [2025-03-09 01:30:53,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 43 transitions, 168 flow [2025-03-09 01:30:53,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 158 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:53,929 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 108 flow [2025-03-09 01:30:53,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2025-03-09 01:30:53,929 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2025-03-09 01:30:53,929 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 108 flow [2025-03-09 01:30:53,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:53,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:53,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:53,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:30:53,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:53,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:53,930 INFO L85 PathProgramCache]: Analyzing trace with hash -190962646, now seen corresponding path program 1 times [2025-03-09 01:30:53,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:53,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235913901] [2025-03-09 01:30:53,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:53,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:53,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:53,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:53,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:53,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:53,968 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-09 01:30:53,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:53,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235913901] [2025-03-09 01:30:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235913901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:30:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12724952] [2025-03-09 01:30:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:30:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:53,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:30:53,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:30:53,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48 [2025-03-09 01:30:53,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:53,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:53,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48 [2025-03-09 01:30:53,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:54,062 INFO L124 PetriNetUnfolderBase]: 147/293 cut-off events. [2025-03-09 01:30:54,062 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:30:54,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 293 events. 147/293 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1229 event pairs, 94 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 535. Up to 234 conditions per place. [2025-03-09 01:30:54,064 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 25 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2025-03-09 01:30:54,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 150 flow [2025-03-09 01:30:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-09 01:30:54,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-03-09 01:30:54,065 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 108 flow. Second operand 4 states and 87 transitions. [2025-03-09 01:30:54,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 150 flow [2025-03-09 01:30:54,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:54,066 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 96 flow [2025-03-09 01:30:54,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-03-09 01:30:54,066 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2025-03-09 01:30:54,066 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 96 flow [2025-03-09 01:30:54,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:54,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:54,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:54,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:30:54,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:54,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:54,067 INFO L85 PathProgramCache]: Analyzing trace with hash -190962645, now seen corresponding path program 1 times [2025-03-09 01:30:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130943358] [2025-03-09 01:30:54,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:54,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:54,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:54,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:54,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:54,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130943358] [2025-03-09 01:30:54,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130943358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:54,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492912087] [2025-03-09 01:30:54,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:54,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:54,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:54,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:54,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:30:54,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:30:54,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:30:54,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:54,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:54,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:30:54,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:54,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:54,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-09 01:30:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492912087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:54,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:54,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-09 01:30:54,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613857353] [2025-03-09 01:30:54,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:54,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:30:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:54,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:30:54,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:54,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-09 01:30:54,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 96 flow. Second operand has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:54,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:54,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-09 01:30:54,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:54,730 INFO L124 PetriNetUnfolderBase]: 307/551 cut-off events. [2025-03-09 01:30:54,730 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:30:54,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 551 events. 307/551 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2590 event pairs, 100 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 1043. Up to 277 conditions per place. [2025-03-09 01:30:54,733 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 43 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-09 01:30:54,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 231 flow [2025-03-09 01:30:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:54,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2025-03-09 01:30:54,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-09 01:30:54,734 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 96 flow. Second operand 5 states and 148 transitions. [2025-03-09 01:30:54,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 231 flow [2025-03-09 01:30:54,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:54,735 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 109 flow [2025-03-09 01:30:54,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-09 01:30:54,736 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2025-03-09 01:30:54,736 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 109 flow [2025-03-09 01:30:54,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.0) internal successors, (220), 10 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:54,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:54,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:54,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:54,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-09 01:30:54,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:54,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:54,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1139789621, now seen corresponding path program 1 times [2025-03-09 01:30:54,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:54,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386046425] [2025-03-09 01:30:54,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:54,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:54,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:54,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:54,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386046425] [2025-03-09 01:30:55,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386046425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:55,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575477213] [2025-03-09 01:30:55,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:55,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:55,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:55,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:55,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:30:55,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:55,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:55,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:30:55,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:55,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:30:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:55,281 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-09 01:30:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575477213] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:55,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:30:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2025-03-09 01:30:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593331743] [2025-03-09 01:30:55,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:55,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:55,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:55,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:55,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 01:30:55,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:55,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 01:30:55,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:55,452 INFO L124 PetriNetUnfolderBase]: 540/931 cut-off events. [2025-03-09 01:30:55,453 INFO L125 PetriNetUnfolderBase]: For 100/128 co-relation queries the response was YES. [2025-03-09 01:30:55,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 931 events. 540/931 cut-off events. For 100/128 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4360 event pairs, 123 based on Foata normal form. 0/742 useless extension candidates. Maximal degree in co-relation 1920. Up to 599 conditions per place. [2025-03-09 01:30:55,457 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 44 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-09 01:30:55,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 246 flow [2025-03-09 01:30:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:30:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:30:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2025-03-09 01:30:55,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-03-09 01:30:55,459 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 109 flow. Second operand 4 states and 112 transitions. [2025-03-09 01:30:55,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 246 flow [2025-03-09 01:30:55,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:30:55,460 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 135 flow [2025-03-09 01:30:55,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2025-03-09 01:30:55,460 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2025-03-09 01:30:55,460 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 135 flow [2025-03-09 01:30:55,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:55,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:55,460 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:55,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:55,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:55,661 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1168506990, now seen corresponding path program 1 times [2025-03-09 01:30:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:55,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333339267] [2025-03-09 01:30:55,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:55,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:55,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:55,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:55,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:55,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:55,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333339267] [2025-03-09 01:30:55,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333339267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:55,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844910909] [2025-03-09 01:30:55,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:55,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:55,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:55,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:55,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:30:55,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:30:55,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:30:55,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:55,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:55,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:55,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:55,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:55,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-09 01:30:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:56,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844910909] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:56,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-09 01:30:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093337456] [2025-03-09 01:30:56,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:56,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:30:56,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:56,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:30:56,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:30:56,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-09 01:30:56,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 135 flow. Second operand has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:56,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:56,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-09 01:30:56,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:56,813 INFO L124 PetriNetUnfolderBase]: 890/1643 cut-off events. [2025-03-09 01:30:56,814 INFO L125 PetriNetUnfolderBase]: For 199/214 co-relation queries the response was YES. [2025-03-09 01:30:56,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3631 conditions, 1643 events. 890/1643 cut-off events. For 199/214 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 9498 event pairs, 520 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 1951. Up to 741 conditions per place. [2025-03-09 01:30:56,820 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 88 selfloop transitions, 9 changer transitions 0/106 dead transitions. [2025-03-09 01:30:56,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 106 transitions, 530 flow [2025-03-09 01:30:56,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:30:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:30:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2025-03-09 01:30:56,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6380208333333334 [2025-03-09 01:30:56,821 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 135 flow. Second operand 8 states and 245 transitions. [2025-03-09 01:30:56,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 106 transitions, 530 flow [2025-03-09 01:30:56,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 106 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:30:56,823 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 202 flow [2025-03-09 01:30:56,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2025-03-09 01:30:56,825 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2025-03-09 01:30:56,826 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 202 flow [2025-03-09 01:30:56,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 21.8125) internal successors, (349), 16 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:56,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:56,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:56,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:57,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:57,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:57,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:57,032 INFO L85 PathProgramCache]: Analyzing trace with hash 973740374, now seen corresponding path program 1 times [2025-03-09 01:30:57,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:57,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178201519] [2025-03-09 01:30:57,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:57,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:57,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:57,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:57,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:57,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178201519] [2025-03-09 01:30:57,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178201519] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:57,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405212889] [2025-03-09 01:30:57,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:57,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:57,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:57,153 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:57,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:30:57,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:30:57,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:30:57,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:57,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:57,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:57,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:57,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-09 01:30:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405212889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:57,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:57,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:30:57,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034963518] [2025-03-09 01:30:57,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:57,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:30:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:57,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:30:57,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:30:57,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 01:30:57,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 202 flow. Second operand has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:57,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:57,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 01:30:57,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:57,802 INFO L124 PetriNetUnfolderBase]: 1125/1925 cut-off events. [2025-03-09 01:30:57,803 INFO L125 PetriNetUnfolderBase]: For 1028/1084 co-relation queries the response was YES. [2025-03-09 01:30:57,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 1925 events. 1125/1925 cut-off events. For 1028/1084 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10381 event pairs, 540 based on Foata normal form. 0/1722 useless extension candidates. Maximal degree in co-relation 3946. Up to 1451 conditions per place. [2025-03-09 01:30:57,812 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 63 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2025-03-09 01:30:57,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 457 flow [2025-03-09 01:30:57,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:30:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:30:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2025-03-09 01:30:57,814 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-09 01:30:57,814 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 202 flow. Second operand 7 states and 176 transitions. [2025-03-09 01:30:57,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 457 flow [2025-03-09 01:30:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 449 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-09 01:30:57,821 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 250 flow [2025-03-09 01:30:57,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-09 01:30:57,821 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-09 01:30:57,822 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 250 flow [2025-03-09 01:30:57,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.46153846153846) internal successors, (240), 13 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:57,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:57,823 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:57,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:58,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:58,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:58,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:58,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1969476288, now seen corresponding path program 2 times [2025-03-09 01:30:58,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:58,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871879152] [2025-03-09 01:30:58,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:58,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:58,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:58,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:58,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:58,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:58,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:58,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871879152] [2025-03-09 01:30:58,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871879152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:58,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863315816] [2025-03-09 01:30:58,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:58,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:58,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:58,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:30:58,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 01:30:58,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 12 statements. [2025-03-09 01:30:58,174 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:58,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:58,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:30:58,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:58,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:30:58,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:58,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:58,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:30:58,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863315816] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:58,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:58,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2025-03-09 01:30:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014466996] [2025-03-09 01:30:58,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:58,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:30:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:58,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:30:58,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:30:58,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 48 [2025-03-09 01:30:58,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 250 flow. Second operand has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:58,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:58,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 48 [2025-03-09 01:30:58,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:58,783 INFO L124 PetriNetUnfolderBase]: 879/1625 cut-off events. [2025-03-09 01:30:58,783 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2025-03-09 01:30:58,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1625 events. 879/1625 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9539 event pairs, 474 based on Foata normal form. 0/1579 useless extension candidates. Maximal degree in co-relation 3509. Up to 1036 conditions per place. [2025-03-09 01:30:58,791 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 52 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2025-03-09 01:30:58,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 446 flow [2025-03-09 01:30:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2025-03-09 01:30:58,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2025-03-09 01:30:58,792 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 250 flow. Second operand 5 states and 139 transitions. [2025-03-09 01:30:58,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 446 flow [2025-03-09 01:30:58,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 429 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:58,796 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 248 flow [2025-03-09 01:30:58,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-03-09 01:30:58,796 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2025-03-09 01:30:58,797 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 248 flow [2025-03-09 01:30:58,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.9) internal successors, (229), 10 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:58,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:58,797 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:58,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:30:58,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:58,998 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:58,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1814460732, now seen corresponding path program 2 times [2025-03-09 01:30:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491173009] [2025-03-09 01:30:58,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:30:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:59,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:30:59,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 13 statements. [2025-03-09 01:30:59,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:30:59,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:30:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491173009] [2025-03-09 01:30:59,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491173009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:30:59,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:30:59,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:30:59,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878585551] [2025-03-09 01:30:59,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:30:59,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:30:59,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:59,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:30:59,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:30:59,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 01:30:59,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:30:59,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 01:30:59,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:30:59,371 INFO L124 PetriNetUnfolderBase]: 1148/1952 cut-off events. [2025-03-09 01:30:59,371 INFO L125 PetriNetUnfolderBase]: For 1955/1955 co-relation queries the response was YES. [2025-03-09 01:30:59,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5341 conditions, 1952 events. 1148/1952 cut-off events. For 1955/1955 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10360 event pairs, 246 based on Foata normal form. 16/1791 useless extension candidates. Maximal degree in co-relation 4463. Up to 1236 conditions per place. [2025-03-09 01:30:59,382 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 63 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2025-03-09 01:30:59,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 523 flow [2025-03-09 01:30:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:30:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:30:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2025-03-09 01:30:59,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2025-03-09 01:30:59,383 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 248 flow. Second operand 5 states and 133 transitions. [2025-03-09 01:30:59,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 523 flow [2025-03-09 01:30:59,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 481 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:30:59,390 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 259 flow [2025-03-09 01:30:59,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=259, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2025-03-09 01:30:59,391 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-09 01:30:59,392 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 259 flow [2025-03-09 01:30:59,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:30:59,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:30:59,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:30:59,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:30:59,392 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:30:59,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:30:59,393 INFO L85 PathProgramCache]: Analyzing trace with hash -539371361, now seen corresponding path program 1 times [2025-03-09 01:30:59,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:30:59,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982671760] [2025-03-09 01:30:59,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:59,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:30:59,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:30:59,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:30:59,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:59,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:59,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:30:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982671760] [2025-03-09 01:30:59,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982671760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:30:59,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883391669] [2025-03-09 01:30:59,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:30:59,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:30:59,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:30:59,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:30:59,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:30:59,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 01:30:59,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:30:59,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:30:59,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:30:59,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 01:30:59,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:30:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:59,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:30:59,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2025-03-09 01:30:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:30:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883391669] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:30:59,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:30:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-03-09 01:30:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649433204] [2025-03-09 01:30:59,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:30:59,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:30:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:30:59,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:30:59,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:31:00,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 01:31:00,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 259 flow. Second operand has 16 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:00,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:00,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 01:31:00,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:00,432 INFO L124 PetriNetUnfolderBase]: 1033/1757 cut-off events. [2025-03-09 01:31:00,432 INFO L125 PetriNetUnfolderBase]: For 1405/1405 co-relation queries the response was YES. [2025-03-09 01:31:00,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4640 conditions, 1757 events. 1033/1757 cut-off events. For 1405/1405 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9182 event pairs, 561 based on Foata normal form. 16/1666 useless extension candidates. Maximal degree in co-relation 4005. Up to 892 conditions per place. [2025-03-09 01:31:00,441 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 74 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2025-03-09 01:31:00,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 94 transitions, 579 flow [2025-03-09 01:31:00,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:31:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:31:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2025-03-09 01:31:00,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-03-09 01:31:00,443 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 259 flow. Second operand 8 states and 210 transitions. [2025-03-09 01:31:00,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 94 transitions, 579 flow [2025-03-09 01:31:00,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 561 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:00,448 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 331 flow [2025-03-09 01:31:00,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=331, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2025-03-09 01:31:00,450 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-09 01:31:00,450 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 331 flow [2025-03-09 01:31:00,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.1875) internal successors, (291), 16 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:00,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:00,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:00,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:00,652 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash -413707346, now seen corresponding path program 1 times [2025-03-09 01:31:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903542004] [2025-03-09 01:31:00,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:00,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:00,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:31:00,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:31:00,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:00,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:31:00,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:00,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903542004] [2025-03-09 01:31:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903542004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865916349] [2025-03-09 01:31:00,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:00,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:00,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:00,804 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:00,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:31:00,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:31:00,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:31:00,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:00,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:00,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:31:00,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:31:00,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:31:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865916349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:31:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 01:31:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32385125] [2025-03-09 01:31:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:00,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:00,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:00,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:00,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:31:00,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 48 [2025-03-09 01:31:00,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 331 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:00,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:00,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 48 [2025-03-09 01:31:00,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:01,148 INFO L124 PetriNetUnfolderBase]: 882/1514 cut-off events. [2025-03-09 01:31:01,148 INFO L125 PetriNetUnfolderBase]: For 1495/1495 co-relation queries the response was YES. [2025-03-09 01:31:01,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 1514 events. 882/1514 cut-off events. For 1495/1495 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7896 event pairs, 288 based on Foata normal form. 32/1497 useless extension candidates. Maximal degree in co-relation 3794. Up to 757 conditions per place. [2025-03-09 01:31:01,154 INFO L140 encePairwiseOnDemand]: 35/48 looper letters, 38 selfloop transitions, 20 changer transitions 0/62 dead transitions. [2025-03-09 01:31:01,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 460 flow [2025-03-09 01:31:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-09 01:31:01,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-09 01:31:01,155 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 331 flow. Second operand 5 states and 116 transitions. [2025-03-09 01:31:01,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 460 flow [2025-03-09 01:31:01,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 62 transitions, 443 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 01:31:01,159 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 322 flow [2025-03-09 01:31:01,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2025-03-09 01:31:01,160 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2025-03-09 01:31:01,160 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 322 flow [2025-03-09 01:31:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:01,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:01,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:01,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 01:31:01,361 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:01,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1188696194, now seen corresponding path program 1 times [2025-03-09 01:31:01,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843687212] [2025-03-09 01:31:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:01,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:01,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:31:01,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:31:01,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:01,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:01,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:01,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843687212] [2025-03-09 01:31:01,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843687212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:01,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:01,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:31:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600025429] [2025-03-09 01:31:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:01,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:31:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:01,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:31:01,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:31:01,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 48 [2025-03-09 01:31:01,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:01,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 48 [2025-03-09 01:31:01,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:01,502 INFO L124 PetriNetUnfolderBase]: 917/1556 cut-off events. [2025-03-09 01:31:01,502 INFO L125 PetriNetUnfolderBase]: For 1996/1996 co-relation queries the response was YES. [2025-03-09 01:31:01,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4808 conditions, 1556 events. 917/1556 cut-off events. For 1996/1996 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7929 event pairs, 233 based on Foata normal form. 2/1516 useless extension candidates. Maximal degree in co-relation 4153. Up to 1170 conditions per place. [2025-03-09 01:31:01,510 INFO L140 encePairwiseOnDemand]: 42/48 looper letters, 59 selfloop transitions, 9 changer transitions 1/73 dead transitions. [2025-03-09 01:31:01,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 573 flow [2025-03-09 01:31:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:31:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:31:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-03-09 01:31:01,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7361111111111112 [2025-03-09 01:31:01,511 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 322 flow. Second operand 3 states and 106 transitions. [2025-03-09 01:31:01,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 573 flow [2025-03-09 01:31:01,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 519 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:31:01,516 INFO L231 Difference]: Finished difference. Result has 60 places, 60 transitions, 389 flow [2025-03-09 01:31:01,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=60, PETRI_TRANSITIONS=60} [2025-03-09 01:31:01,516 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2025-03-09 01:31:01,516 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 60 transitions, 389 flow [2025-03-09 01:31:01,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:01,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:01,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:31:01,517 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:01,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:01,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1312800766, now seen corresponding path program 1 times [2025-03-09 01:31:01,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:01,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044659356] [2025-03-09 01:31:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:01,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:01,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:31:01,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:31:01,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:01,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:01,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044659356] [2025-03-09 01:31:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044659356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:01,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:01,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:01,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825431471] [2025-03-09 01:31:01,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:01,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:01,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:01,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:01,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:01,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-03-09 01:31:01,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 60 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:01,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-03-09 01:31:01,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:01,838 INFO L124 PetriNetUnfolderBase]: 1038/1744 cut-off events. [2025-03-09 01:31:01,838 INFO L125 PetriNetUnfolderBase]: For 2043/2043 co-relation queries the response was YES. [2025-03-09 01:31:01,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5286 conditions, 1744 events. 1038/1744 cut-off events. For 2043/2043 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9239 event pairs, 373 based on Foata normal form. 18/1760 useless extension candidates. Maximal degree in co-relation 4556. Up to 964 conditions per place. [2025-03-09 01:31:01,846 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 115 selfloop transitions, 9 changer transitions 0/126 dead transitions. [2025-03-09 01:31:01,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 126 transitions, 1020 flow [2025-03-09 01:31:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-03-09 01:31:01,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791666666666667 [2025-03-09 01:31:01,847 INFO L175 Difference]: Start difference. First operand has 60 places, 60 transitions, 389 flow. Second operand 5 states and 163 transitions. [2025-03-09 01:31:01,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 126 transitions, 1020 flow [2025-03-09 01:31:01,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 126 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:01,852 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 453 flow [2025-03-09 01:31:01,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-03-09 01:31:01,852 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2025-03-09 01:31:01,852 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 453 flow [2025-03-09 01:31:01,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:01,853 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:01,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:31:01,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1379976300, now seen corresponding path program 2 times [2025-03-09 01:31:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:01,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355534850] [2025-03-09 01:31:01,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:01,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:01,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:31:01,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-09 01:31:01,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:01,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355534850] [2025-03-09 01:31:01,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355534850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:01,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:01,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:31:01,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726594511] [2025-03-09 01:31:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:31:01,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:01,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:31:01,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:31:01,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:01,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:01,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:01,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:01,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:02,106 INFO L124 PetriNetUnfolderBase]: 888/1476 cut-off events. [2025-03-09 01:31:02,106 INFO L125 PetriNetUnfolderBase]: For 2659/2659 co-relation queries the response was YES. [2025-03-09 01:31:02,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5033 conditions, 1476 events. 888/1476 cut-off events. For 2659/2659 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6896 event pairs, 461 based on Foata normal form. 32/1508 useless extension candidates. Maximal degree in co-relation 4396. Up to 1147 conditions per place. [2025-03-09 01:31:02,114 INFO L140 encePairwiseOnDemand]: 43/48 looper letters, 71 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2025-03-09 01:31:02,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 729 flow [2025-03-09 01:31:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:31:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:31:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2025-03-09 01:31:02,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-03-09 01:31:02,115 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 453 flow. Second operand 4 states and 118 transitions. [2025-03-09 01:31:02,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 729 flow [2025-03-09 01:31:02,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 702 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:02,122 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 448 flow [2025-03-09 01:31:02,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=448, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2025-03-09 01:31:02,122 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2025-03-09 01:31:02,122 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 448 flow [2025-03-09 01:31:02,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:02,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:02,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 01:31:02,122 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:02,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:02,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1574544197, now seen corresponding path program 1 times [2025-03-09 01:31:02,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:02,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418645171] [2025-03-09 01:31:02,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:02,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:02,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:31:02,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:31:02,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:02,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:02,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:02,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418645171] [2025-03-09 01:31:02,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418645171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:02,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:02,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:31:02,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905766067] [2025-03-09 01:31:02,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:02,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:02,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:02,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:02,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:02,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:02,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:02,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:02,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:02,487 INFO L124 PetriNetUnfolderBase]: 1028/1728 cut-off events. [2025-03-09 01:31:02,488 INFO L125 PetriNetUnfolderBase]: For 3625/3625 co-relation queries the response was YES. [2025-03-09 01:31:02,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6212 conditions, 1728 events. 1028/1728 cut-off events. For 3625/3625 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8952 event pairs, 319 based on Foata normal form. 24/1752 useless extension candidates. Maximal degree in co-relation 5557. Up to 860 conditions per place. [2025-03-09 01:31:02,495 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 104 selfloop transitions, 20 changer transitions 0/125 dead transitions. [2025-03-09 01:31:02,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 125 transitions, 1092 flow [2025-03-09 01:31:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:31:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:31:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-03-09 01:31:02,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-09 01:31:02,497 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 448 flow. Second operand 6 states and 184 transitions. [2025-03-09 01:31:02,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 125 transitions, 1092 flow [2025-03-09 01:31:02,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 125 transitions, 1047 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:02,505 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 631 flow [2025-03-09 01:31:02,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=631, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2025-03-09 01:31:02,505 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2025-03-09 01:31:02,505 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 631 flow [2025-03-09 01:31:02,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:02,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:02,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:31:02,506 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:02,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1879938681, now seen corresponding path program 2 times [2025-03-09 01:31:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:02,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007098146] [2025-03-09 01:31:02,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:02,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:31:02,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-09 01:31:02,520 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:02,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:02,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:02,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007098146] [2025-03-09 01:31:02,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007098146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:02,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:02,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:31:02,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004143447] [2025-03-09 01:31:02,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:02,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:02,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:02,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:02,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:02,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:02,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:02,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:02,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:02,895 INFO L124 PetriNetUnfolderBase]: 1278/2166 cut-off events. [2025-03-09 01:31:02,896 INFO L125 PetriNetUnfolderBase]: For 6140/6140 co-relation queries the response was YES. [2025-03-09 01:31:02,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8261 conditions, 2166 events. 1278/2166 cut-off events. For 6140/6140 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11223 event pairs, 473 based on Foata normal form. 24/2190 useless extension candidates. Maximal degree in co-relation 7474. Up to 1129 conditions per place. [2025-03-09 01:31:02,906 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 105 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2025-03-09 01:31:02,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 133 transitions, 1278 flow [2025-03-09 01:31:02,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:31:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:31:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 197 transitions. [2025-03-09 01:31:02,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5863095238095238 [2025-03-09 01:31:02,907 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 631 flow. Second operand 7 states and 197 transitions. [2025-03-09 01:31:02,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 133 transitions, 1278 flow [2025-03-09 01:31:02,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 133 transitions, 1244 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:02,921 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 794 flow [2025-03-09 01:31:02,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=794, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2025-03-09 01:31:02,922 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2025-03-09 01:31:02,922 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 794 flow [2025-03-09 01:31:02,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:02,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:02,923 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:02,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:31:02,923 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:02,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:02,923 INFO L85 PathProgramCache]: Analyzing trace with hash 418757597, now seen corresponding path program 3 times [2025-03-09 01:31:02,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:02,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736611139] [2025-03-09 01:31:02,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:02,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:02,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:31:02,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 20 statements. [2025-03-09 01:31:02,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:31:02,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736611139] [2025-03-09 01:31:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736611139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:02,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:02,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:02,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867345609] [2025-03-09 01:31:02,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:02,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:02,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:02,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:03,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:03,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 794 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:03,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:03,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:03,238 INFO L124 PetriNetUnfolderBase]: 1258/2110 cut-off events. [2025-03-09 01:31:03,239 INFO L125 PetriNetUnfolderBase]: For 8269/8269 co-relation queries the response was YES. [2025-03-09 01:31:03,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8586 conditions, 2110 events. 1258/2110 cut-off events. For 8269/8269 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11041 event pairs, 463 based on Foata normal form. 6/2116 useless extension candidates. Maximal degree in co-relation 7787. Up to 1064 conditions per place. [2025-03-09 01:31:03,249 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 95 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2025-03-09 01:31:03,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 124 transitions, 1320 flow [2025-03-09 01:31:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2025-03-09 01:31:03,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-09 01:31:03,250 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 794 flow. Second operand 5 states and 155 transitions. [2025-03-09 01:31:03,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 124 transitions, 1320 flow [2025-03-09 01:31:03,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 124 transitions, 1266 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:03,264 INFO L231 Difference]: Finished difference. Result has 88 places, 84 transitions, 880 flow [2025-03-09 01:31:03,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=880, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2025-03-09 01:31:03,265 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2025-03-09 01:31:03,265 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 880 flow [2025-03-09 01:31:03,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:03,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:03,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:31:03,266 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:03,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:03,267 INFO L85 PathProgramCache]: Analyzing trace with hash 148280907, now seen corresponding path program 4 times [2025-03-09 01:31:03,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:03,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434246782] [2025-03-09 01:31:03,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:03,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:03,272 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:31:03,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:31:03,280 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:03,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:03,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:03,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434246782] [2025-03-09 01:31:03,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434246782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:03,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:03,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736605373] [2025-03-09 01:31:03,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:03,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:03,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:03,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:03,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:03,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:03,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:03,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:03,565 INFO L124 PetriNetUnfolderBase]: 1252/2104 cut-off events. [2025-03-09 01:31:03,565 INFO L125 PetriNetUnfolderBase]: For 10026/10026 co-relation queries the response was YES. [2025-03-09 01:31:03,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8834 conditions, 2104 events. 1252/2104 cut-off events. For 10026/10026 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10693 event pairs, 647 based on Foata normal form. 6/2110 useless extension candidates. Maximal degree in co-relation 8039. Up to 1651 conditions per place. [2025-03-09 01:31:03,575 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 77 selfloop transitions, 36 changer transitions 0/114 dead transitions. [2025-03-09 01:31:03,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 114 transitions, 1361 flow [2025-03-09 01:31:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:31:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:31:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2025-03-09 01:31:03,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-03-09 01:31:03,577 INFO L175 Difference]: Start difference. First operand has 88 places, 84 transitions, 880 flow. Second operand 5 states and 145 transitions. [2025-03-09 01:31:03,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 114 transitions, 1361 flow [2025-03-09 01:31:03,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 114 transitions, 1305 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:03,594 INFO L231 Difference]: Finished difference. Result has 93 places, 96 transitions, 1129 flow [2025-03-09 01:31:03,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1129, PETRI_PLACES=93, PETRI_TRANSITIONS=96} [2025-03-09 01:31:03,595 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2025-03-09 01:31:03,595 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 96 transitions, 1129 flow [2025-03-09 01:31:03,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:03,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:03,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 01:31:03,595 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:03,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1535153555, now seen corresponding path program 5 times [2025-03-09 01:31:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:03,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506500938] [2025-03-09 01:31:03,596 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:31:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:03,600 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:31:03,608 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:31:03,608 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:03,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506500938] [2025-03-09 01:31:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506500938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:03,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:31:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025850384] [2025-03-09 01:31:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:03,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:31:03,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:03,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:31:03,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:31:03,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:03,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 96 transitions, 1129 flow. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:03,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:03,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:03,949 INFO L124 PetriNetUnfolderBase]: 1210/2020 cut-off events. [2025-03-09 01:31:03,950 INFO L125 PetriNetUnfolderBase]: For 10720/10720 co-relation queries the response was YES. [2025-03-09 01:31:03,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8615 conditions, 2020 events. 1210/2020 cut-off events. For 10720/10720 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10044 event pairs, 591 based on Foata normal form. 24/2044 useless extension candidates. Maximal degree in co-relation 7828. Up to 1519 conditions per place. [2025-03-09 01:31:03,959 INFO L140 encePairwiseOnDemand]: 41/48 looper letters, 85 selfloop transitions, 38 changer transitions 0/124 dead transitions. [2025-03-09 01:31:03,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 124 transitions, 1514 flow [2025-03-09 01:31:03,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:31:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:31:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2025-03-09 01:31:03,961 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-09 01:31:03,961 INFO L175 Difference]: Start difference. First operand has 93 places, 96 transitions, 1129 flow. Second operand 6 states and 171 transitions. [2025-03-09 01:31:03,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 124 transitions, 1514 flow [2025-03-09 01:31:03,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 124 transitions, 1463 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:03,982 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 1225 flow [2025-03-09 01:31:03,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1225, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2025-03-09 01:31:03,982 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 53 predicate places. [2025-03-09 01:31:03,982 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 1225 flow [2025-03-09 01:31:03,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:03,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:03,982 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:03,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:31:03,982 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:03,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1366391628, now seen corresponding path program 1 times [2025-03-09 01:31:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:03,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908038553] [2025-03-09 01:31:03,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:03,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:31:03,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:31:03,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:03,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:04,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:04,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908038553] [2025-03-09 01:31:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908038553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:04,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 01:31:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395949121] [2025-03-09 01:31:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 01:31:04,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 01:31:04,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:31:04,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:04,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 1225 flow. Second operand has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:04,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:04,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:04,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:04,809 INFO L124 PetriNetUnfolderBase]: 2052/3477 cut-off events. [2025-03-09 01:31:04,809 INFO L125 PetriNetUnfolderBase]: For 16012/16012 co-relation queries the response was YES. [2025-03-09 01:31:04,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14506 conditions, 3477 events. 2052/3477 cut-off events. For 16012/16012 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 20236 event pairs, 397 based on Foata normal form. 60/3537 useless extension candidates. Maximal degree in co-relation 13268. Up to 1024 conditions per place. [2025-03-09 01:31:04,824 INFO L140 encePairwiseOnDemand]: 38/48 looper letters, 225 selfloop transitions, 72 changer transitions 0/298 dead transitions. [2025-03-09 01:31:04,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 298 transitions, 3524 flow [2025-03-09 01:31:04,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:31:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:31:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 342 transitions. [2025-03-09 01:31:04,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2025-03-09 01:31:04,825 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 1225 flow. Second operand 11 states and 342 transitions. [2025-03-09 01:31:04,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 298 transitions, 3524 flow [2025-03-09 01:31:04,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 298 transitions, 3358 flow, removed 23 selfloop flow, removed 2 redundant places. [2025-03-09 01:31:04,857 INFO L231 Difference]: Finished difference. Result has 116 places, 147 transitions, 2061 flow [2025-03-09 01:31:04,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2061, PETRI_PLACES=116, PETRI_TRANSITIONS=147} [2025-03-09 01:31:04,858 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 69 predicate places. [2025-03-09 01:31:04,858 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 147 transitions, 2061 flow [2025-03-09 01:31:04,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.625) internal successors, (165), 8 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:04,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:04,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:04,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:31:04,858 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:04,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash 235064532, now seen corresponding path program 2 times [2025-03-09 01:31:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:04,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750965119] [2025-03-09 01:31:04,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:04,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:04,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:31:04,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 22 statements. [2025-03-09 01:31:04,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:04,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:31:04,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:04,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750965119] [2025-03-09 01:31:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750965119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:31:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486537768] [2025-03-09 01:31:04,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:04,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:31:04,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:04,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:31:04,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:31:04,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:04,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 147 transitions, 2061 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:04,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:04,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:04,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:05,342 INFO L124 PetriNetUnfolderBase]: 2028/3473 cut-off events. [2025-03-09 01:31:05,342 INFO L125 PetriNetUnfolderBase]: For 24791/24791 co-relation queries the response was YES. [2025-03-09 01:31:05,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17248 conditions, 3473 events. 2028/3473 cut-off events. For 24791/24791 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 19898 event pairs, 788 based on Foata normal form. 78/3551 useless extension candidates. Maximal degree in co-relation 16298. Up to 2092 conditions per place. [2025-03-09 01:31:05,364 INFO L140 encePairwiseOnDemand]: 40/48 looper letters, 165 selfloop transitions, 67 changer transitions 0/233 dead transitions. [2025-03-09 01:31:05,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 233 transitions, 3475 flow [2025-03-09 01:31:05,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:31:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:31:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 169 transitions. [2025-03-09 01:31:05,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5868055555555556 [2025-03-09 01:31:05,365 INFO L175 Difference]: Start difference. First operand has 116 places, 147 transitions, 2061 flow. Second operand 6 states and 169 transitions. [2025-03-09 01:31:05,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 233 transitions, 3475 flow [2025-03-09 01:31:05,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 3364 flow, removed 28 selfloop flow, removed 1 redundant places. [2025-03-09 01:31:05,414 INFO L231 Difference]: Finished difference. Result has 123 places, 165 transitions, 2495 flow [2025-03-09 01:31:05,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1986, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2495, PETRI_PLACES=123, PETRI_TRANSITIONS=165} [2025-03-09 01:31:05,415 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 76 predicate places. [2025-03-09 01:31:05,415 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 165 transitions, 2495 flow [2025-03-09 01:31:05,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:05,415 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-09 01:31:05,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 01:31:05,415 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:05,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1364669770, now seen corresponding path program 1 times [2025-03-09 01:31:05,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:05,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988495382] [2025-03-09 01:31:05,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:05,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:05,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:31:05,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:05,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988495382] [2025-03-09 01:31:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988495382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:05,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:05,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:31:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61944902] [2025-03-09 01:31:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:31:05,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:05,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:31:05,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:31:05,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-03-09 01:31:05,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 165 transitions, 2495 flow. Second operand has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:05,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:05,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-03-09 01:31:05,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:06,198 INFO L124 PetriNetUnfolderBase]: 2179/3849 cut-off events. [2025-03-09 01:31:06,198 INFO L125 PetriNetUnfolderBase]: For 30977/30985 co-relation queries the response was YES. [2025-03-09 01:31:06,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19609 conditions, 3849 events. 2179/3849 cut-off events. For 30977/30985 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 23735 event pairs, 437 based on Foata normal form. 20/3869 useless extension candidates. Maximal degree in co-relation 18503. Up to 1037 conditions per place. [2025-03-09 01:31:06,217 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 249 selfloop transitions, 99 changer transitions 0/350 dead transitions. [2025-03-09 01:31:06,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 350 transitions, 4648 flow [2025-03-09 01:31:06,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:31:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:31:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 395 transitions. [2025-03-09 01:31:06,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6330128205128205 [2025-03-09 01:31:06,218 INFO L175 Difference]: Start difference. First operand has 123 places, 165 transitions, 2495 flow. Second operand 13 states and 395 transitions. [2025-03-09 01:31:06,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 350 transitions, 4648 flow [2025-03-09 01:31:06,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 350 transitions, 4496 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:06,284 INFO L231 Difference]: Finished difference. Result has 139 places, 209 transitions, 3228 flow [2025-03-09 01:31:06,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2391, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3228, PETRI_PLACES=139, PETRI_TRANSITIONS=209} [2025-03-09 01:31:06,284 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 92 predicate places. [2025-03-09 01:31:06,285 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 209 transitions, 3228 flow [2025-03-09 01:31:06,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.142857142857142) internal successors, (155), 7 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:06,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:06,285 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-09 01:31:06,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 01:31:06,285 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1717415190, now seen corresponding path program 1 times [2025-03-09 01:31:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:06,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869736647] [2025-03-09 01:31:06,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:06,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:31:06,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:06,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:06,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:06,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:06,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869736647] [2025-03-09 01:31:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869736647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:06,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919108895] [2025-03-09 01:31:06,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:31:06,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:06,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:06,414 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:06,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:31:06,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 01:31:06,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:31:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:06,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:31:06,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:06,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 01:31:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:31:06,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:10,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2025-03-09 01:31:11,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:31:11,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 159 [2025-03-09 01:31:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:31:13,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919108895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:13,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:13,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2025-03-09 01:31:13,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506365810] [2025-03-09 01:31:13,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:13,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:31:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:13,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:31:13,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=307, Unknown=1, NotChecked=0, Total=380 [2025-03-09 01:31:13,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 48 [2025-03-09 01:31:13,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 209 transitions, 3228 flow. Second operand has 20 states, 20 states have (on average 22.15) internal successors, (443), 20 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:13,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:13,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 48 [2025-03-09 01:31:13,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:18,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:31:22,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:31:28,633 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-09 01:31:30,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 01:31:31,064 INFO L124 PetriNetUnfolderBase]: 5033/8693 cut-off events. [2025-03-09 01:31:31,064 INFO L125 PetriNetUnfolderBase]: For 69197/69244 co-relation queries the response was YES. [2025-03-09 01:31:31,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44885 conditions, 8693 events. 5033/8693 cut-off events. For 69197/69244 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 57471 event pairs, 275 based on Foata normal form. 53/8741 useless extension candidates. Maximal degree in co-relation 43981. Up to 1441 conditions per place. [2025-03-09 01:31:31,123 INFO L140 encePairwiseOnDemand]: 32/48 looper letters, 426 selfloop transitions, 247 changer transitions 272/953 dead transitions. [2025-03-09 01:31:31,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 953 transitions, 12133 flow [2025-03-09 01:31:31,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-09 01:31:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-09 01:31:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 1761 transitions. [2025-03-09 01:31:31,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5823412698412699 [2025-03-09 01:31:31,126 INFO L175 Difference]: Start difference. First operand has 139 places, 209 transitions, 3228 flow. Second operand 63 states and 1761 transitions. [2025-03-09 01:31:31,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 953 transitions, 12133 flow [2025-03-09 01:31:31,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 953 transitions, 11757 flow, removed 113 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:31,348 INFO L231 Difference]: Finished difference. Result has 230 places, 344 transitions, 5210 flow [2025-03-09 01:31:31,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3103, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=5210, PETRI_PLACES=230, PETRI_TRANSITIONS=344} [2025-03-09 01:31:31,349 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 183 predicate places. [2025-03-09 01:31:31,349 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 344 transitions, 5210 flow [2025-03-09 01:31:31,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 22.15) internal successors, (443), 20 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:31,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:31,349 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-09 01:31:31,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:31:31,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 01:31:31,550 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:31,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash -423556974, now seen corresponding path program 2 times [2025-03-09 01:31:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:31,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788114167] [2025-03-09 01:31:31,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:31,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:31,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:31,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-03-09 01:31:31,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:31:31,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:31,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:31,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788114167] [2025-03-09 01:31:31,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788114167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:31:31,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:31:31,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 01:31:31,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310339458] [2025-03-09 01:31:31,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:31:31,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:31:31,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:31,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:31:31,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:31:31,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:31,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 344 transitions, 5210 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:31,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:31,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:31,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:32,874 INFO L124 PetriNetUnfolderBase]: 3737/6412 cut-off events. [2025-03-09 01:31:32,874 INFO L125 PetriNetUnfolderBase]: For 94809/94809 co-relation queries the response was YES. [2025-03-09 01:31:32,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41220 conditions, 6412 events. 3737/6412 cut-off events. For 94809/94809 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 39046 event pairs, 1263 based on Foata normal form. 6/6418 useless extension candidates. Maximal degree in co-relation 40851. Up to 3204 conditions per place. [2025-03-09 01:31:32,934 INFO L140 encePairwiseOnDemand]: 36/48 looper letters, 364 selfloop transitions, 108 changer transitions 0/473 dead transitions. [2025-03-09 01:31:32,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 473 transitions, 7536 flow [2025-03-09 01:31:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:31:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:31:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 288 transitions. [2025-03-09 01:31:32,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 01:31:32,935 INFO L175 Difference]: Start difference. First operand has 230 places, 344 transitions, 5210 flow. Second operand 9 states and 288 transitions. [2025-03-09 01:31:32,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 473 transitions, 7536 flow [2025-03-09 01:31:33,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 473 transitions, 6700 flow, removed 349 selfloop flow, removed 18 redundant places. [2025-03-09 01:31:33,269 INFO L231 Difference]: Finished difference. Result has 210 places, 357 transitions, 5069 flow [2025-03-09 01:31:33,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4524, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5069, PETRI_PLACES=210, PETRI_TRANSITIONS=357} [2025-03-09 01:31:33,270 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 163 predicate places. [2025-03-09 01:31:33,270 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 357 transitions, 5069 flow [2025-03-09 01:31:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:33,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:33,270 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-09 01:31:33,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 01:31:33,270 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:33,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 277830124, now seen corresponding path program 3 times [2025-03-09 01:31:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971649126] [2025-03-09 01:31:33,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:33,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:33,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:33,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:31:33,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:33,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971649126] [2025-03-09 01:31:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971649126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572695634] [2025-03-09 01:31:33,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:31:33,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:33,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:33,426 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:33,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:31:33,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:33,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:33,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:31:33,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:33,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:31:33,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:33,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:33,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572695634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:33,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:33,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2025-03-09 01:31:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724257698] [2025-03-09 01:31:33,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:33,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:31:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:33,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:31:33,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:31:33,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:33,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 357 transitions, 5069 flow. Second operand has 16 states, 16 states have (on average 20.5) internal successors, (328), 16 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:33,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:33,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:33,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:35,281 INFO L124 PetriNetUnfolderBase]: 4346/7544 cut-off events. [2025-03-09 01:31:35,281 INFO L125 PetriNetUnfolderBase]: For 96746/96746 co-relation queries the response was YES. [2025-03-09 01:31:35,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46730 conditions, 7544 events. 4346/7544 cut-off events. For 96746/96746 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 48483 event pairs, 1575 based on Foata normal form. 32/7576 useless extension candidates. Maximal degree in co-relation 46478. Up to 4544 conditions per place. [2025-03-09 01:31:35,333 INFO L140 encePairwiseOnDemand]: 33/48 looper letters, 401 selfloop transitions, 247 changer transitions 4/653 dead transitions. [2025-03-09 01:31:35,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 653 transitions, 9708 flow [2025-03-09 01:31:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 01:31:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-09 01:31:35,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 625 transitions. [2025-03-09 01:31:35,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5425347222222222 [2025-03-09 01:31:35,335 INFO L175 Difference]: Start difference. First operand has 210 places, 357 transitions, 5069 flow. Second operand 24 states and 625 transitions. [2025-03-09 01:31:35,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 653 transitions, 9708 flow [2025-03-09 01:31:35,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 653 transitions, 9638 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-09 01:31:35,658 INFO L231 Difference]: Finished difference. Result has 245 places, 514 transitions, 8159 flow [2025-03-09 01:31:35,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4923, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8159, PETRI_PLACES=245, PETRI_TRANSITIONS=514} [2025-03-09 01:31:35,659 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 198 predicate places. [2025-03-09 01:31:35,659 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 514 transitions, 8159 flow [2025-03-09 01:31:35,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 20.5) internal successors, (328), 16 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:35,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:35,659 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-09 01:31:35,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 01:31:35,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 01:31:35,860 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:35,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1353216730, now seen corresponding path program 4 times [2025-03-09 01:31:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:35,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505490743] [2025-03-09 01:31:35,860 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:35,864 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:35,870 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:35,870 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:35,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:31:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505490743] [2025-03-09 01:31:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505490743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319943321] [2025-03-09 01:31:36,219 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:31:36,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:36,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:36,221 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:36,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:31:36,260 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-09 01:31:36,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 01:31:36,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 01:31:36,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:36,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:31:36,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:36,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:31:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319943321] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:36,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:36,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-09 01:31:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393581578] [2025-03-09 01:31:36,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:36,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:31:36,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:36,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:31:36,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:31:36,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:36,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 514 transitions, 8159 flow. Second operand has 19 states, 19 states have (on average 20.894736842105264) internal successors, (397), 19 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:36,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:36,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:36,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:31:50,763 INFO L124 PetriNetUnfolderBase]: 5628/9887 cut-off events. [2025-03-09 01:31:50,763 INFO L125 PetriNetUnfolderBase]: For 171488/171488 co-relation queries the response was YES. [2025-03-09 01:31:50,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68862 conditions, 9887 events. 5628/9887 cut-off events. For 171488/171488 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 68239 event pairs, 559 based on Foata normal form. 60/9947 useless extension candidates. Maximal degree in co-relation 67901. Up to 2320 conditions per place. [2025-03-09 01:31:50,851 INFO L140 encePairwiseOnDemand]: 28/48 looper letters, 340 selfloop transitions, 359 changer transitions 640/1340 dead transitions. [2025-03-09 01:31:50,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1340 transitions, 20980 flow [2025-03-09 01:31:50,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-09 01:31:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-09 01:31:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 2163 transitions. [2025-03-09 01:31:50,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5239825581395349 [2025-03-09 01:31:50,853 INFO L175 Difference]: Start difference. First operand has 245 places, 514 transitions, 8159 flow. Second operand 86 states and 2163 transitions. [2025-03-09 01:31:50,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1340 transitions, 20980 flow [2025-03-09 01:31:51,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1340 transitions, 20175 flow, removed 260 selfloop flow, removed 10 redundant places. [2025-03-09 01:31:51,673 INFO L231 Difference]: Finished difference. Result has 351 places, 522 transitions, 8705 flow [2025-03-09 01:31:51,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7628, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=8705, PETRI_PLACES=351, PETRI_TRANSITIONS=522} [2025-03-09 01:31:51,674 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 304 predicate places. [2025-03-09 01:31:51,674 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 522 transitions, 8705 flow [2025-03-09 01:31:51,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 20.894736842105264) internal successors, (397), 19 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:51,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:31:51,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:31:51,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:31:51,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 01:31:51,875 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:31:51,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:31:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash 111342246, now seen corresponding path program 2 times [2025-03-09 01:31:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:31:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304985465] [2025-03-09 01:31:51,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:31:51,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:31:51,887 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:51,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:51,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:31:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304985465] [2025-03-09 01:31:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304985465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:31:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132003709] [2025-03-09 01:31:52,091 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:31:52,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:31:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:31:52,093 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:31:52,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:31:52,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-09 01:31:52,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:31:52,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:31:52,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:31:52,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:31:52,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:31:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:52,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:31:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:31:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132003709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:31:52,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:31:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2025-03-09 01:31:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453362661] [2025-03-09 01:31:52,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:31:52,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:31:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:31:52,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:31:52,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:31:52,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:31:52,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 522 transitions, 8705 flow. Second operand has 21 states, 21 states have (on average 19.904761904761905) internal successors, (418), 21 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:31:52,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:31:52,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:31:52,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:04,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-09 01:32:05,339 INFO L124 PetriNetUnfolderBase]: 3833/6886 cut-off events. [2025-03-09 01:32:05,339 INFO L125 PetriNetUnfolderBase]: For 168131/168131 co-relation queries the response was YES. [2025-03-09 01:32:05,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55116 conditions, 6886 events. 3833/6886 cut-off events. For 168131/168131 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 45793 event pairs, 579 based on Foata normal form. 12/6898 useless extension candidates. Maximal degree in co-relation 54992. Up to 1676 conditions per place. [2025-03-09 01:32:05,426 INFO L140 encePairwiseOnDemand]: 34/48 looper letters, 515 selfloop transitions, 406 changer transitions 0/922 dead transitions. [2025-03-09 01:32:05,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 922 transitions, 16394 flow [2025-03-09 01:32:05,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 01:32:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-09 01:32:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 883 transitions. [2025-03-09 01:32:05,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255952380952381 [2025-03-09 01:32:05,427 INFO L175 Difference]: Start difference. First operand has 351 places, 522 transitions, 8705 flow. Second operand 35 states and 883 transitions. [2025-03-09 01:32:05,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 922 transitions, 16394 flow [2025-03-09 01:32:06,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 922 transitions, 14122 flow, removed 1084 selfloop flow, removed 32 redundant places. [2025-03-09 01:32:06,289 INFO L231 Difference]: Finished difference. Result has 289 places, 667 transitions, 10916 flow [2025-03-09 01:32:06,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7564, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=10916, PETRI_PLACES=289, PETRI_TRANSITIONS=667} [2025-03-09 01:32:06,290 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 242 predicate places. [2025-03-09 01:32:06,290 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 667 transitions, 10916 flow [2025-03-09 01:32:06,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 19.904761904761905) internal successors, (418), 21 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:06,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:32:06,290 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:32:06,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:32:06,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 01:32:06,491 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2025-03-09 01:32:06,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:32:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash 643683588, now seen corresponding path program 3 times [2025-03-09 01:32:06,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:32:06,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277625281] [2025-03-09 01:32:06,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:32:06,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:32:06,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-09 01:32:06,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 25 statements. [2025-03-09 01:32:06,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:32:06,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:06,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:32:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:32:06,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277625281] [2025-03-09 01:32:06,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277625281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:32:06,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304668043] [2025-03-09 01:32:06,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:32:06,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:32:06,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:32:06,761 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:32:06,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:32:06,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-09 01:32:06,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 25 statements. [2025-03-09 01:32:06,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:32:06,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:32:06,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 01:32:06,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:32:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:32:06,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:32:07,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:32:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304668043] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:32:07,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:32:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2025-03-09 01:32:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107154474] [2025-03-09 01:32:07,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:32:07,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:32:07,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:32:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:32:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:32:07,140 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 48 [2025-03-09 01:32:07,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 667 transitions, 10916 flow. Second operand has 19 states, 19 states have (on average 19.894736842105264) internal successors, (378), 19 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:32:07,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:32:07,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 48 [2025-03-09 01:32:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:32:23,300 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 31 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)