./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.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/chl-nzb-file-symm.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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:20:25,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:20:25,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:20:25,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:20:25,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:20:25,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:20:25,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:20:25,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:20:25,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:20:25,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:20:25,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:20:25,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:20:25,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:20:25,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:20:25,432 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:20:25,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:20:25,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:20:25,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:20:25,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:25,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:20:25,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:20:25,434 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-03-09 01:20:25,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:20:25,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:20:25,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:20:25,708 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:20:25,708 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:20:25,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-09 01:20:26,930 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad6195a26/656b1f51e55b4e53b227d3797b682290/FLAG57b38784a [2025-03-09 01:20:27,128 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:20:27,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-09 01:20:27,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad6195a26/656b1f51e55b4e53b227d3797b682290/FLAG57b38784a [2025-03-09 01:20:27,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad6195a26/656b1f51e55b4e53b227d3797b682290 [2025-03-09 01:20:27,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:20:27,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:20:27,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:27,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:20:27,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:20:27,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41826497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27, skipping insertion in model container [2025-03-09 01:20:27,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:20:27,339 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:20:27,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:27,352 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:20:27,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:27,404 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:20:27,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27 WrapperNode [2025-03-09 01:20:27,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:27,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:27,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:20:27,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:20:27,410 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:20:27" (1/1) ... [2025-03-09 01:20:27,419 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:20:27" (1/1) ... [2025-03-09 01:20:27,453 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 401 [2025-03-09 01:20:27,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:27,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:20:27,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:20:27,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:20:27,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,491 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-09 01:20:27,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:20:27,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:20:27,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:20:27,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:20:27,518 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (1/1) ... [2025-03-09 01:20:27,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:27,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:27,544 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:20:27,550 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:20:27,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:20:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:20:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:20:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:20:27,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:20:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:20:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:20:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:20:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:20:27,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:20:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:20:27,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:20:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:20:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:20:27,569 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:20:27,677 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:20:27,679 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:20:28,298 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:20:28,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:20:28,660 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:20:28,660 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:20:28,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:28 BoogieIcfgContainer [2025-03-09 01:20:28,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:20:28,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:20:28,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:20:28,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:20:28,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:20:27" (1/3) ... [2025-03-09 01:20:28,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a010c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:28, skipping insertion in model container [2025-03-09 01:20:28,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:27" (2/3) ... [2025-03-09 01:20:28,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a010c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:28, skipping insertion in model container [2025-03-09 01:20:28,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:28" (3/3) ... [2025-03-09 01:20:28,670 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-03-09 01:20:28,683 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:20:28,684 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 107 locations, 1 initial locations, 4 loop locations, and 38 error locations. [2025-03-09 01:20:28,685 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:20:28,764 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:20:28,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 126 transitions, 266 flow [2025-03-09 01:20:28,838 INFO L124 PetriNetUnfolderBase]: 20/124 cut-off events. [2025-03-09 01:20:28,842 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:20:28,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 124 events. 20/124 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 393 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2025-03-09 01:20:28,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 126 transitions, 266 flow [2025-03-09 01:20:28,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 123 transitions, 258 flow [2025-03-09 01:20:28,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:20:28,870 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;@2b519034, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:20:28,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-09 01:20:28,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:20:28,875 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:20:28,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:20:28,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:28,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:28,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:28,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1169888, now seen corresponding path program 1 times [2025-03-09 01:20:28,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941410955] [2025-03-09 01:20:28,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:28,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:28,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,106 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:20:29,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941410955] [2025-03-09 01:20:29,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941410955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:29,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:29,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:20:29,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006675486] [2025-03-09 01:20:29,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:29,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:29,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:29,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-09 01:20:29,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:20:29,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:29,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-09 01:20:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:29,699 INFO L124 PetriNetUnfolderBase]: 1446/3461 cut-off events. [2025-03-09 01:20:29,699 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-09 01:20:29,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5601 conditions, 3461 events. 1446/3461 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25166 event pairs, 790 based on Foata normal form. 1/2625 useless extension candidates. Maximal degree in co-relation 5456. Up to 2083 conditions per place. [2025-03-09 01:20:29,721 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 56 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2025-03-09 01:20:29,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 117 transitions, 362 flow [2025-03-09 01:20:29,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:29,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:29,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-03-09 01:20:29,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6587301587301587 [2025-03-09 01:20:29,731 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 258 flow. Second operand 3 states and 249 transitions. [2025-03-09 01:20:29,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 117 transitions, 362 flow [2025-03-09 01:20:29,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 117 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:29,737 INFO L231 Difference]: Finished difference. Result has 104 places, 117 transitions, 242 flow [2025-03-09 01:20:29,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=104, PETRI_TRANSITIONS=117} [2025-03-09 01:20:29,741 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-03-09 01:20:29,741 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 117 transitions, 242 flow [2025-03-09 01:20:29,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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:20:29,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:29,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:29,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:20:29,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:29,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:29,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1169889, now seen corresponding path program 1 times [2025-03-09 01:20:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:29,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115724664] [2025-03-09 01:20:29,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:29,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:29,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:29,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:29,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,955 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:20:29,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115724664] [2025-03-09 01:20:29,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115724664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:29,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:29,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:29,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061920876] [2025-03-09 01:20:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:29,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:29,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:30,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-09 01:20:30,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 117 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:20:30,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:30,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-09 01:20:30,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:30,468 INFO L124 PetriNetUnfolderBase]: 1448/3467 cut-off events. [2025-03-09 01:20:30,468 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-09 01:20:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5585 conditions, 3467 events. 1448/3467 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25234 event pairs, 790 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 5549. Up to 2092 conditions per place. [2025-03-09 01:20:30,486 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 61 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-09 01:20:30,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 123 transitions, 388 flow [2025-03-09 01:20:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:30,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-03-09 01:20:30,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671957671957672 [2025-03-09 01:20:30,488 INFO L175 Difference]: Start difference. First operand has 104 places, 117 transitions, 242 flow. Second operand 3 states and 254 transitions. [2025-03-09 01:20:30,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 123 transitions, 388 flow [2025-03-09 01:20:30,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 123 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:30,491 INFO L231 Difference]: Finished difference. Result has 106 places, 121 transitions, 278 flow [2025-03-09 01:20:30,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=106, PETRI_TRANSITIONS=121} [2025-03-09 01:20:30,492 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -4 predicate places. [2025-03-09 01:20:30,492 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 121 transitions, 278 flow [2025-03-09 01:20:30,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:20:30,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:30,492 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:20:30,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:20:30,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:30,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:30,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1124298277, now seen corresponding path program 1 times [2025-03-09 01:20:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:30,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076560983] [2025-03-09 01:20:30,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:30,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:30,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:30,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,744 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:20:30,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:30,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076560983] [2025-03-09 01:20:30,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076560983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:30,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929562445] [2025-03-09 01:20:30,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:30,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:30,747 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:20:30,749 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:20:30,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:30,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:30,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:20:30,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:30,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:30,916 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:20:30,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:30,969 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:20:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929562445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:30,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:30,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-09 01:20:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529825671] [2025-03-09 01:20:30,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:30,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:20:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:30,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:20:30,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:20:31,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-09 01:20:31,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 121 transitions, 278 flow. Second operand has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:20:31,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:31,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-09 01:20:31,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:31,604 INFO L124 PetriNetUnfolderBase]: 1450/3481 cut-off events. [2025-03-09 01:20:31,605 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 01:20:31,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 3481 events. 1450/3481 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25245 event pairs, 790 based on Foata normal form. 4/2648 useless extension candidates. Maximal degree in co-relation 5581. Up to 2093 conditions per place. [2025-03-09 01:20:31,622 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 66 selfloop transitions, 14 changer transitions 0/137 dead transitions. [2025-03-09 01:20:31,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 488 flow [2025-03-09 01:20:31,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:31,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2025-03-09 01:20:31,624 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-03-09 01:20:31,624 INFO L175 Difference]: Start difference. First operand has 106 places, 121 transitions, 278 flow. Second operand 6 states and 462 transitions. [2025-03-09 01:20:31,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 137 transitions, 488 flow [2025-03-09 01:20:31,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 137 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:31,629 INFO L231 Difference]: Finished difference. Result has 112 places, 129 transitions, 362 flow [2025-03-09 01:20:31,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=112, PETRI_TRANSITIONS=129} [2025-03-09 01:20:31,630 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-03-09 01:20:31,631 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 129 transitions, 362 flow [2025-03-09 01:20:31,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 63.666666666666664) internal successors, (573), 9 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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:20:31,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:31,631 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 01:20:31,639 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:20:31,836 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:20:31,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:31,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:31,837 INFO L85 PathProgramCache]: Analyzing trace with hash -851368719, now seen corresponding path program 2 times [2025-03-09 01:20:31,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:31,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683603150] [2025-03-09 01:20:31,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:31,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:20:31,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:31,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:32,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:32,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683603150] [2025-03-09 01:20:32,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683603150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014911920] [2025-03-09 01:20:32,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:32,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:32,145 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:20:32,147 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:20:32,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:20:32,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:32,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:32,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:32,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:20:32,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:32,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:32,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014911920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:32,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:32,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2025-03-09 01:20:32,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617304654] [2025-03-09 01:20:32,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:32,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:20:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:32,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:20:32,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:20:33,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-09 01:20:33,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 129 transitions, 362 flow. Second operand has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states 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:20:33,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:33,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-09 01:20:33,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:33,832 INFO L124 PetriNetUnfolderBase]: 1452/3485 cut-off events. [2025-03-09 01:20:33,832 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-03-09 01:20:33,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5674 conditions, 3485 events. 1452/3485 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25280 event pairs, 790 based on Foata normal form. 4/2654 useless extension candidates. Maximal degree in co-relation 5593. Up to 2086 conditions per place. [2025-03-09 01:20:33,845 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 61 selfloop transitions, 23 changer transitions 0/141 dead transitions. [2025-03-09 01:20:33,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 141 transitions, 554 flow [2025-03-09 01:20:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 646 transitions. [2025-03-09 01:20:33,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5696649029982364 [2025-03-09 01:20:33,848 INFO L175 Difference]: Start difference. First operand has 112 places, 129 transitions, 362 flow. Second operand 9 states and 646 transitions. [2025-03-09 01:20:33,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 141 transitions, 554 flow [2025-03-09 01:20:33,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 141 transitions, 496 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:33,851 INFO L231 Difference]: Finished difference. Result has 114 places, 133 transitions, 370 flow [2025-03-09 01:20:33,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=370, PETRI_PLACES=114, PETRI_TRANSITIONS=133} [2025-03-09 01:20:33,852 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-09 01:20:33,852 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 133 transitions, 370 flow [2025-03-09 01:20:33,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.833333333333336) internal successors, (1149), 18 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states 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:20:33,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:33,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:33,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:20:34,057 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,SelfDestructingSolverStorable3 [2025-03-09 01:20:34,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:34,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash 551373356, now seen corresponding path program 1 times [2025-03-09 01:20:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:34,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066843995] [2025-03-09 01:20:34,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:34,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:34,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:34,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:34,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:34,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066843995] [2025-03-09 01:20:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066843995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447346557] [2025-03-09 01:20:34,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:34,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:34,150 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:20:34,152 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:20:34,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:34,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:34,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:34,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:20:34,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:34,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:34,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447346557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:34,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:34,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 01:20:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378829831] [2025-03-09 01:20:34,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:34,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:34,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:34,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:34,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-09 01:20:34,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 133 transitions, 370 flow. Second operand has 10 states, 10 states have (on average 66.6) internal successors, (666), 10 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:20:34,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:34,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-09 01:20:34,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:34,627 INFO L124 PetriNetUnfolderBase]: 1446/3479 cut-off events. [2025-03-09 01:20:34,627 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-09 01:20:34,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5654 conditions, 3479 events. 1446/3479 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25177 event pairs, 790 based on Foata normal form. 6/2650 useless extension candidates. Maximal degree in co-relation 5549. Up to 2087 conditions per place. [2025-03-09 01:20:34,643 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 62 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2025-03-09 01:20:34,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 135 transitions, 522 flow [2025-03-09 01:20:34,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:34,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 530 transitions. [2025-03-09 01:20:34,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6009070294784581 [2025-03-09 01:20:34,649 INFO L175 Difference]: Start difference. First operand has 114 places, 133 transitions, 370 flow. Second operand 7 states and 530 transitions. [2025-03-09 01:20:34,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 135 transitions, 522 flow [2025-03-09 01:20:34,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 135 transitions, 490 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:34,657 INFO L231 Difference]: Finished difference. Result has 114 places, 127 transitions, 334 flow [2025-03-09 01:20:34,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=114, PETRI_TRANSITIONS=127} [2025-03-09 01:20:34,658 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-09 01:20:34,658 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 127 transitions, 334 flow [2025-03-09 01:20:34,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 66.6) internal successors, (666), 10 states have internal predecessors, (666), 0 states have call successors, (0), 0 states 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:20:34,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:34,659 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:34,665 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:20:34,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:34,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:34,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:34,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1439896439, now seen corresponding path program 2 times [2025-03-09 01:20:34,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:34,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030998846] [2025-03-09 01:20:34,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:34,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:34,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-09 01:20:34,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 29 statements. [2025-03-09 01:20:34,883 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:34,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:34,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:34,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030998846] [2025-03-09 01:20:34,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030998846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:34,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:34,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:34,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502250173] [2025-03-09 01:20:34,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:34,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:34,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:34,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:34,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:35,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-03-09 01:20:35,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 127 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 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:20:35,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:35,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-03-09 01:20:35,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:35,274 INFO L124 PetriNetUnfolderBase]: 1446/3291 cut-off events. [2025-03-09 01:20:35,275 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-09 01:20:35,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 3291 events. 1446/3291 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 22580 event pairs, 790 based on Foata normal form. 0/2643 useless extension candidates. Maximal degree in co-relation 5364. Up to 2082 conditions per place. [2025-03-09 01:20:35,290 INFO L140 encePairwiseOnDemand]: 115/126 looper letters, 67 selfloop transitions, 3 changer transitions 0/119 dead transitions. [2025-03-09 01:20:35,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 119 transitions, 458 flow [2025-03-09 01:20:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-03-09 01:20:35,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-09 01:20:35,292 INFO L175 Difference]: Start difference. First operand has 114 places, 127 transitions, 334 flow. Second operand 5 states and 336 transitions. [2025-03-09 01:20:35,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 119 transitions, 458 flow [2025-03-09 01:20:35,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 119 transitions, 426 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:35,294 INFO L231 Difference]: Finished difference. Result has 104 places, 119 transitions, 292 flow [2025-03-09 01:20:35,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=104, PETRI_TRANSITIONS=119} [2025-03-09 01:20:35,295 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -6 predicate places. [2025-03-09 01:20:35,295 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 119 transitions, 292 flow [2025-03-09 01:20:35,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 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:20:35,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:35,296 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:35,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:20:35,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:35,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1439896440, now seen corresponding path program 1 times [2025-03-09 01:20:35,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:35,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138376396] [2025-03-09 01:20:35,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:35,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:35,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:20:35,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:20:35,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:35,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-09 01:20:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138376396] [2025-03-09 01:20:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138376396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395752180] [2025-03-09 01:20:35,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:35,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:35,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:35,811 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:20:35,812 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:20:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 01:20:35,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 01:20:35,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:35,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:35,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 01:20:35,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:35,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:36,032 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:20:36,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:20:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:36,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:20:36,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395752180] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:36,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:20:36,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6, 12] total 26 [2025-03-09 01:20:36,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442154671] [2025-03-09 01:20:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:36,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:36,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:36,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:36,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:20:37,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:20:37,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 119 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:20:37,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:37,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:20:37,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:37,453 INFO L124 PetriNetUnfolderBase]: 2117/4066 cut-off events. [2025-03-09 01:20:37,453 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-09 01:20:37,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 4066 events. 2117/4066 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 25131 event pairs, 598 based on Foata normal form. 0/3381 useless extension candidates. Maximal degree in co-relation 7197. Up to 2114 conditions per place. [2025-03-09 01:20:37,469 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 99 selfloop transitions, 6 changer transitions 0/150 dead transitions. [2025-03-09 01:20:37,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 150 transitions, 567 flow [2025-03-09 01:20:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 457 transitions. [2025-03-09 01:20:37,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6044973544973545 [2025-03-09 01:20:37,472 INFO L175 Difference]: Start difference. First operand has 104 places, 119 transitions, 292 flow. Second operand 6 states and 457 transitions. [2025-03-09 01:20:37,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 150 transitions, 567 flow [2025-03-09 01:20:37,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 150 transitions, 562 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:37,474 INFO L231 Difference]: Finished difference. Result has 105 places, 117 transitions, 306 flow [2025-03-09 01:20:37,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=105, PETRI_TRANSITIONS=117} [2025-03-09 01:20:37,476 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -5 predicate places. [2025-03-09 01:20:37,477 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 306 flow [2025-03-09 01:20:37,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.1) internal successors, (621), 10 states have internal predecessors, (621), 0 states have call successors, (0), 0 states 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:20:37,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:37,478 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:37,485 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:20:37,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:37,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:37,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash 614949009, now seen corresponding path program 1 times [2025-03-09 01:20:37,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256260757] [2025-03-09 01:20:37,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:37,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:20:37,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:20:37,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:37,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:20:37,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:37,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256260757] [2025-03-09 01:20:37,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256260757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:37,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065490359] [2025-03-09 01:20:37,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:37,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:37,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:37,956 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:20:37,958 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:20:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:20:38,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:20:38,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:38,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:38,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:20:38,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:38,227 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:20:38,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:38,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-09 01:20:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:20:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065490359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:38,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:38,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-03-09 01:20:38,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324407914] [2025-03-09 01:20:38,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:38,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:20:38,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:38,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:20:38,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:20:39,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:20:39,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 306 flow. Second operand has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states 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:20:39,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:39,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:20:39,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:40,502 INFO L124 PetriNetUnfolderBase]: 4185/8570 cut-off events. [2025-03-09 01:20:40,502 INFO L125 PetriNetUnfolderBase]: For 964/1022 co-relation queries the response was YES. [2025-03-09 01:20:40,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15518 conditions, 8570 events. 4185/8570 cut-off events. For 964/1022 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 59650 event pairs, 768 based on Foata normal form. 0/7428 useless extension candidates. Maximal degree in co-relation 15424. Up to 2462 conditions per place. [2025-03-09 01:20:40,534 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 144 selfloop transitions, 15 changer transitions 0/201 dead transitions. [2025-03-09 01:20:40,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 201 transitions, 840 flow [2025-03-09 01:20:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 760 transitions. [2025-03-09 01:20:40,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-03-09 01:20:40,540 INFO L175 Difference]: Start difference. First operand has 105 places, 117 transitions, 306 flow. Second operand 10 states and 760 transitions. [2025-03-09 01:20:40,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 201 transitions, 840 flow [2025-03-09 01:20:40,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 201 transitions, 826 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:40,548 INFO L231 Difference]: Finished difference. Result has 110 places, 116 transitions, 341 flow [2025-03-09 01:20:40,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=341, PETRI_PLACES=110, PETRI_TRANSITIONS=116} [2025-03-09 01:20:40,553 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2025-03-09 01:20:40,553 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 116 transitions, 341 flow [2025-03-09 01:20:40,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.59090909090909) internal successors, (1377), 22 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states 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:20:40,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:40,553 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:40,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 01:20:40,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:40,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:40,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:40,755 INFO L85 PathProgramCache]: Analyzing trace with hash 614949008, now seen corresponding path program 1 times [2025-03-09 01:20:40,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315607184] [2025-03-09 01:20:40,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:40,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:20:40,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:20:40,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:40,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-09 01:20:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:40,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315607184] [2025-03-09 01:20:40,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315607184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:40,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:40,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:40,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860195170] [2025-03-09 01:20:40,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:40,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:40,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:40,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:40,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 126 [2025-03-09 01:20:40,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 116 transitions, 341 flow. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:20:40,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:40,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 126 [2025-03-09 01:20:40,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:41,321 INFO L124 PetriNetUnfolderBase]: 4097/7958 cut-off events. [2025-03-09 01:20:41,321 INFO L125 PetriNetUnfolderBase]: For 1265/1319 co-relation queries the response was YES. [2025-03-09 01:20:41,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15296 conditions, 7958 events. 4097/7958 cut-off events. For 1265/1319 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 51731 event pairs, 2625 based on Foata normal form. 158/7118 useless extension candidates. Maximal degree in co-relation 15190. Up to 6062 conditions per place. [2025-03-09 01:20:41,353 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 71 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-03-09 01:20:41,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 108 transitions, 471 flow [2025-03-09 01:20:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:41,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-03-09 01:20:41,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2025-03-09 01:20:41,354 INFO L175 Difference]: Start difference. First operand has 110 places, 116 transitions, 341 flow. Second operand 4 states and 282 transitions. [2025-03-09 01:20:41,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 108 transitions, 471 flow [2025-03-09 01:20:41,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 108 transitions, 450 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:41,359 INFO L231 Difference]: Finished difference. Result has 99 places, 108 transitions, 308 flow [2025-03-09 01:20:41,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=99, PETRI_TRANSITIONS=108} [2025-03-09 01:20:41,359 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -11 predicate places. [2025-03-09 01:20:41,360 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 108 transitions, 308 flow [2025-03-09 01:20:41,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 4 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:20:41,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:41,360 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:41,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 01:20:41,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:41,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:41,360 INFO L85 PathProgramCache]: Analyzing trace with hash 761047900, now seen corresponding path program 1 times [2025-03-09 01:20:41,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:41,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436014515] [2025-03-09 01:20:41,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:41,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:41,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:20:41,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:20:41,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:41,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:20:41,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436014515] [2025-03-09 01:20:41,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436014515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:41,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959846060] [2025-03-09 01:20:41,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:41,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:41,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:41,634 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:20:41,639 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:20:41,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 01:20:41,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 01:20:41,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:41,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:20:41,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:20:41,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:41,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-09 01:20:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:20:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959846060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:41,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-03-09 01:20:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888264588] [2025-03-09 01:20:41,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 01:20:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:42,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 01:20:42,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-03-09 01:20:42,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:20:42,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 108 transitions, 308 flow. Second operand has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states 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:20:42,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:42,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:20:42,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:44,238 INFO L124 PetriNetUnfolderBase]: 9460/17539 cut-off events. [2025-03-09 01:20:44,238 INFO L125 PetriNetUnfolderBase]: For 2449/2527 co-relation queries the response was YES. [2025-03-09 01:20:44,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33992 conditions, 17539 events. 9460/17539 cut-off events. For 2449/2527 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 120719 event pairs, 2682 based on Foata normal form. 0/14921 useless extension candidates. Maximal degree in co-relation 33894. Up to 5035 conditions per place. [2025-03-09 01:20:44,308 INFO L140 encePairwiseOnDemand]: 111/126 looper letters, 164 selfloop transitions, 18 changer transitions 0/213 dead transitions. [2025-03-09 01:20:44,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 213 transitions, 949 flow [2025-03-09 01:20:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:44,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 780 transitions. [2025-03-09 01:20:44,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-03-09 01:20:44,310 INFO L175 Difference]: Start difference. First operand has 99 places, 108 transitions, 308 flow. Second operand 10 states and 780 transitions. [2025-03-09 01:20:44,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 213 transitions, 949 flow [2025-03-09 01:20:44,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 213 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:44,316 INFO L231 Difference]: Finished difference. Result has 109 places, 114 transitions, 400 flow [2025-03-09 01:20:44,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=400, PETRI_PLACES=109, PETRI_TRANSITIONS=114} [2025-03-09 01:20:44,317 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, -1 predicate places. [2025-03-09 01:20:44,317 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 114 transitions, 400 flow [2025-03-09 01:20:44,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 62.45454545454545) internal successors, (1374), 22 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states 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:20:44,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:44,318 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:44,324 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:20:44,518 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:20:44,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:44,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:44,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1739449195, now seen corresponding path program 1 times [2025-03-09 01:20:44,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:44,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843563775] [2025-03-09 01:20:44,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:44,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:44,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:20:44,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:20:44,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:44,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:44,832 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:20:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843563775] [2025-03-09 01:20:44,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843563775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:44,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402841371] [2025-03-09 01:20:44,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:44,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:44,835 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:20:44,836 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:20:44,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 01:20:44,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 01:20:44,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:44,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:44,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-09 01:20:44,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:44,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:45,063 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:20:45,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:20:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:45,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:20:45,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402841371] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:45,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:20:45,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 13] total 26 [2025-03-09 01:20:45,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557644822] [2025-03-09 01:20:45,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:45,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:45,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:45,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:45,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:20:45,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:20:45,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 114 transitions, 400 flow. Second operand has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:20:45,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:45,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:20:45,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:47,174 INFO L124 PetriNetUnfolderBase]: 11605/21037 cut-off events. [2025-03-09 01:20:47,174 INFO L125 PetriNetUnfolderBase]: For 7674/8118 co-relation queries the response was YES. [2025-03-09 01:20:47,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43501 conditions, 21037 events. 11605/21037 cut-off events. For 7674/8118 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 147966 event pairs, 4204 based on Foata normal form. 0/17967 useless extension candidates. Maximal degree in co-relation 43390. Up to 8492 conditions per place. [2025-03-09 01:20:47,403 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 125 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2025-03-09 01:20:47,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 166 transitions, 837 flow [2025-03-09 01:20:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:20:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:20:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 471 transitions. [2025-03-09 01:20:47,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.623015873015873 [2025-03-09 01:20:47,405 INFO L175 Difference]: Start difference. First operand has 109 places, 114 transitions, 400 flow. Second operand 6 states and 471 transitions. [2025-03-09 01:20:47,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 166 transitions, 837 flow [2025-03-09 01:20:47,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 166 transitions, 816 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:47,415 INFO L231 Difference]: Finished difference. Result has 110 places, 119 transitions, 446 flow [2025-03-09 01:20:47,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=446, PETRI_PLACES=110, PETRI_TRANSITIONS=119} [2025-03-09 01:20:47,415 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 0 predicate places. [2025-03-09 01:20:47,416 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 119 transitions, 446 flow [2025-03-09 01:20:47,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 62.4) internal successors, (624), 10 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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:20:47,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:47,416 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:47,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:20:47,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:47,617 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:47,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1580452108, now seen corresponding path program 1 times [2025-03-09 01:20:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:47,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602504470] [2025-03-09 01:20:47,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:47,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:47,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:20:47,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:20:47,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:47,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:48,188 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:48,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:48,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602504470] [2025-03-09 01:20:48,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602504470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:48,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:48,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:20:48,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131417572] [2025-03-09 01:20:48,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:48,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:48,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:48,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:48,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:48,190 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-09 01:20:48,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 119 transitions, 446 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:20:48,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:48,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-09 01:20:48,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:50,130 INFO L124 PetriNetUnfolderBase]: 11054/21060 cut-off events. [2025-03-09 01:20:50,130 INFO L125 PetriNetUnfolderBase]: For 12358/12726 co-relation queries the response was YES. [2025-03-09 01:20:50,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46220 conditions, 21060 events. 11054/21060 cut-off events. For 12358/12726 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 154230 event pairs, 6653 based on Foata normal form. 6/18392 useless extension candidates. Maximal degree in co-relation 46114. Up to 15403 conditions per place. [2025-03-09 01:20:50,276 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 114 selfloop transitions, 1 changer transitions 9/159 dead transitions. [2025-03-09 01:20:50,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 159 transitions, 831 flow [2025-03-09 01:20:50,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 349 transitions. [2025-03-09 01:20:50,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6924603174603174 [2025-03-09 01:20:50,279 INFO L175 Difference]: Start difference. First operand has 110 places, 119 transitions, 446 flow. Second operand 4 states and 349 transitions. [2025-03-09 01:20:50,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 159 transitions, 831 flow [2025-03-09 01:20:50,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 159 transitions, 826 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:50,298 INFO L231 Difference]: Finished difference. Result has 112 places, 119 transitions, 450 flow [2025-03-09 01:20:50,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=450, PETRI_PLACES=112, PETRI_TRANSITIONS=119} [2025-03-09 01:20:50,299 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-03-09 01:20:50,299 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 119 transitions, 450 flow [2025-03-09 01:20:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:20:50,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:50,299 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 01:20:50,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1921187488, now seen corresponding path program 2 times [2025-03-09 01:20:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8194700] [2025-03-09 01:20:50,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:50,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:20:50,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 37 statements. [2025-03-09 01:20:50,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:50,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:50,634 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:50,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8194700] [2025-03-09 01:20:50,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8194700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:50,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:50,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:20:50,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925807159] [2025-03-09 01:20:50,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:50,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:50,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:50,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:50,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-09 01:20:50,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 119 transitions, 450 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:20:50,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:50,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-09 01:20:50,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:52,161 INFO L124 PetriNetUnfolderBase]: 11313/21657 cut-off events. [2025-03-09 01:20:52,161 INFO L125 PetriNetUnfolderBase]: For 13314/13682 co-relation queries the response was YES. [2025-03-09 01:20:52,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47695 conditions, 21657 events. 11313/21657 cut-off events. For 13314/13682 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 159612 event pairs, 6969 based on Foata normal form. 5/18913 useless extension candidates. Maximal degree in co-relation 47619. Up to 15958 conditions per place. [2025-03-09 01:20:52,268 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 114 selfloop transitions, 1 changer transitions 7/157 dead transitions. [2025-03-09 01:20:52,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 157 transitions, 827 flow [2025-03-09 01:20:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:52,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2025-03-09 01:20:52,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6884920634920635 [2025-03-09 01:20:52,270 INFO L175 Difference]: Start difference. First operand has 112 places, 119 transitions, 450 flow. Second operand 4 states and 347 transitions. [2025-03-09 01:20:52,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 157 transitions, 827 flow [2025-03-09 01:20:52,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 157 transitions, 821 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:52,284 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 456 flow [2025-03-09 01:20:52,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=456, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-03-09 01:20:52,285 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-09 01:20:52,285 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 456 flow [2025-03-09 01:20:52,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:20:52,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:52,285 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:52,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:20:52,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:52,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash -259270709, now seen corresponding path program 1 times [2025-03-09 01:20:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948919144] [2025-03-09 01:20:52,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:52,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:20:52,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:20:52,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:52,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:52,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:52,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948919144] [2025-03-09 01:20:52,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948919144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:52,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:52,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015673211] [2025-03-09 01:20:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:52,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:52,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:52,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:52,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-09 01:20:52,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:20:52,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:52,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-09 01:20:52,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:54,006 INFO L124 PetriNetUnfolderBase]: 10579/20281 cut-off events. [2025-03-09 01:20:54,007 INFO L125 PetriNetUnfolderBase]: For 13650/14014 co-relation queries the response was YES. [2025-03-09 01:20:54,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44748 conditions, 20281 events. 10579/20281 cut-off events. For 13650/14014 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 148322 event pairs, 4067 based on Foata normal form. 161/17812 useless extension candidates. Maximal degree in co-relation 44695. Up to 15331 conditions per place. [2025-03-09 01:20:54,103 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 87 selfloop transitions, 2 changer transitions 5/129 dead transitions. [2025-03-09 01:20:54,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 129 transitions, 685 flow [2025-03-09 01:20:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2025-03-09 01:20:54,104 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-03-09 01:20:54,104 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 456 flow. Second operand 3 states and 262 transitions. [2025-03-09 01:20:54,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 129 transitions, 685 flow [2025-03-09 01:20:54,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 682 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:54,118 INFO L231 Difference]: Finished difference. Result has 114 places, 119 transitions, 474 flow [2025-03-09 01:20:54,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=114, PETRI_TRANSITIONS=119} [2025-03-09 01:20:54,120 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 4 predicate places. [2025-03-09 01:20:54,120 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 119 transitions, 474 flow [2025-03-09 01:20:54,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states 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:20:54,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:54,120 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:20:54,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:20:54,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:54,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:54,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1380170616, now seen corresponding path program 1 times [2025-03-09 01:20:54,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:54,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781312438] [2025-03-09 01:20:54,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:54,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:54,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:20:54,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:20:54,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:54,208 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:54,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781312438] [2025-03-09 01:20:54,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781312438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:54,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:54,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:54,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769158822] [2025-03-09 01:20:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:54,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:54,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:54,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:54,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:54,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 126 [2025-03-09 01:20:54,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 119 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:20:54,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:54,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 126 [2025-03-09 01:20:54,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:55,584 INFO L124 PetriNetUnfolderBase]: 10248/19431 cut-off events. [2025-03-09 01:20:55,584 INFO L125 PetriNetUnfolderBase]: For 13603/13951 co-relation queries the response was YES. [2025-03-09 01:20:55,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43486 conditions, 19431 events. 10248/19431 cut-off events. For 13603/13951 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 141000 event pairs, 5947 based on Foata normal form. 86/17038 useless extension candidates. Maximal degree in co-relation 43380. Up to 12655 conditions per place. [2025-03-09 01:20:55,697 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 120 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2025-03-09 01:20:55,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 158 transitions, 867 flow [2025-03-09 01:20:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2025-03-09 01:20:55,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.746031746031746 [2025-03-09 01:20:55,698 INFO L175 Difference]: Start difference. First operand has 114 places, 119 transitions, 474 flow. Second operand 3 states and 282 transitions. [2025-03-09 01:20:55,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 158 transitions, 867 flow [2025-03-09 01:20:55,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 158 transitions, 857 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:55,719 INFO L231 Difference]: Finished difference. Result has 113 places, 120 transitions, 481 flow [2025-03-09 01:20:55,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=481, PETRI_PLACES=113, PETRI_TRANSITIONS=120} [2025-03-09 01:20:55,720 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 3 predicate places. [2025-03-09 01:20:55,720 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 120 transitions, 481 flow [2025-03-09 01:20:55,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:20:55,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:55,721 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 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:20:55,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 01:20:55,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:55,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1524945477, now seen corresponding path program 1 times [2025-03-09 01:20:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:55,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826885138] [2025-03-09 01:20:55,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:55,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:55,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:20:55,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:20:55,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:20:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826885138] [2025-03-09 01:20:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826885138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206023829] [2025-03-09 01:20:56,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:56,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:56,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:56,041 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:20:56,042 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:20:56,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:20:56,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:20:56,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:56,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:56,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:20:56,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:56,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:56,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206023829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:56,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:56,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2025-03-09 01:20:56,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508652917] [2025-03-09 01:20:56,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:56,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:56,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:56,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:56,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:56,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 126 [2025-03-09 01:20:56,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 120 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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:20:56,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:56,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 126 [2025-03-09 01:20:56,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:59,145 INFO L124 PetriNetUnfolderBase]: 17013/30638 cut-off events. [2025-03-09 01:20:59,145 INFO L125 PetriNetUnfolderBase]: For 21180/21970 co-relation queries the response was YES. [2025-03-09 01:20:59,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70288 conditions, 30638 events. 17013/30638 cut-off events. For 21180/21970 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 229472 event pairs, 7099 based on Foata normal form. 0/27399 useless extension candidates. Maximal degree in co-relation 70182. Up to 15603 conditions per place. [2025-03-09 01:20:59,392 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 253 selfloop transitions, 7 changer transitions 0/292 dead transitions. [2025-03-09 01:20:59,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 292 transitions, 1689 flow [2025-03-09 01:20:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 622 transitions. [2025-03-09 01:20:59,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7052154195011338 [2025-03-09 01:20:59,394 INFO L175 Difference]: Start difference. First operand has 113 places, 120 transitions, 481 flow. Second operand 7 states and 622 transitions. [2025-03-09 01:20:59,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 292 transitions, 1689 flow [2025-03-09 01:20:59,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 292 transitions, 1686 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:59,421 INFO L231 Difference]: Finished difference. Result has 122 places, 123 transitions, 515 flow [2025-03-09 01:20:59,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=122, PETRI_TRANSITIONS=123} [2025-03-09 01:20:59,422 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 12 predicate places. [2025-03-09 01:20:59,422 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 515 flow [2025-03-09 01:20:59,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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:20:59,422 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:59,422 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:59,428 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:20:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:20:59,623 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:20:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2128143458, now seen corresponding path program 1 times [2025-03-09 01:20:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522016182] [2025-03-09 01:20:59,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:59,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:59,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 01:20:59,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 01:20:59,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:59,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522016182] [2025-03-09 01:20:59,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522016182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:59,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:59,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:20:59,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279300801] [2025-03-09 01:20:59,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:59,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:59,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:59,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:59,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:59,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:20:59,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 515 flow. Second operand has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:20:59,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:59,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:20:59,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:02,093 INFO L124 PetriNetUnfolderBase]: 18116/31825 cut-off events. [2025-03-09 01:21:02,093 INFO L125 PetriNetUnfolderBase]: For 24969/25810 co-relation queries the response was YES. [2025-03-09 01:21:02,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79154 conditions, 31825 events. 18116/31825 cut-off events. For 24969/25810 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 231391 event pairs, 7383 based on Foata normal form. 0/29311 useless extension candidates. Maximal degree in co-relation 79044. Up to 14771 conditions per place. [2025-03-09 01:21:02,314 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 209 selfloop transitions, 12 changer transitions 0/252 dead transitions. [2025-03-09 01:21:02,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 252 transitions, 1469 flow [2025-03-09 01:21:02,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2025-03-09 01:21:02,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-03-09 01:21:02,316 INFO L175 Difference]: Start difference. First operand has 122 places, 123 transitions, 515 flow. Second operand 6 states and 524 transitions. [2025-03-09 01:21:02,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 252 transitions, 1469 flow [2025-03-09 01:21:02,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 252 transitions, 1462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:02,398 INFO L231 Difference]: Finished difference. Result has 127 places, 126 transitions, 555 flow [2025-03-09 01:21:02,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=127, PETRI_TRANSITIONS=126} [2025-03-09 01:21:02,398 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 17 predicate places. [2025-03-09 01:21:02,398 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 126 transitions, 555 flow [2025-03-09 01:21:02,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:21:02,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:02,399 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:02,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 01:21:02,399 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:21:02,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1950744669, now seen corresponding path program 1 times [2025-03-09 01:21:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386048928] [2025-03-09 01:21:02,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:02,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:21:02,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:21:02,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:02,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:21:02,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386048928] [2025-03-09 01:21:02,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386048928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:02,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:02,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 01:21:02,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110794626] [2025-03-09 01:21:02,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:02,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:21:02,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:02,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:21:02,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:21:02,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:21:02,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 126 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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:21:02,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:02,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:21:02,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:05,400 INFO L124 PetriNetUnfolderBase]: 20866/35627 cut-off events. [2025-03-09 01:21:05,400 INFO L125 PetriNetUnfolderBase]: For 30393/31513 co-relation queries the response was YES. [2025-03-09 01:21:05,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92309 conditions, 35627 events. 20866/35627 cut-off events. For 30393/31513 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 258508 event pairs, 7930 based on Foata normal form. 288/34132 useless extension candidates. Maximal degree in co-relation 92198. Up to 16686 conditions per place. [2025-03-09 01:21:05,710 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 218 selfloop transitions, 10 changer transitions 0/259 dead transitions. [2025-03-09 01:21:05,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 259 transitions, 1541 flow [2025-03-09 01:21:05,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2025-03-09 01:21:05,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-03-09 01:21:05,711 INFO L175 Difference]: Start difference. First operand has 127 places, 126 transitions, 555 flow. Second operand 6 states and 528 transitions. [2025-03-09 01:21:05,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 259 transitions, 1541 flow [2025-03-09 01:21:05,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 259 transitions, 1525 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:05,767 INFO L231 Difference]: Finished difference. Result has 131 places, 127 transitions, 590 flow [2025-03-09 01:21:05,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=131, PETRI_TRANSITIONS=127} [2025-03-09 01:21:05,767 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 21 predicate places. [2025-03-09 01:21:05,767 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 127 transitions, 590 flow [2025-03-09 01:21:05,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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:21:05,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:05,768 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:05,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 01:21:05,768 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:21:05,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:05,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1948611136, now seen corresponding path program 1 times [2025-03-09 01:21:05,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:05,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484010615] [2025-03-09 01:21:05,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:05,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:05,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 01:21:05,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 01:21:05,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:05,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:21:05,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484010615] [2025-03-09 01:21:05,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484010615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:05,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:05,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:05,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183868234] [2025-03-09 01:21:05,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:05,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:05,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:05,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:05,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:21:05,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 127 transitions, 590 flow. Second operand has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:21:05,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:05,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:21:05,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:08,648 INFO L124 PetriNetUnfolderBase]: 20571/35423 cut-off events. [2025-03-09 01:21:08,648 INFO L125 PetriNetUnfolderBase]: For 35918/36995 co-relation queries the response was YES. [2025-03-09 01:21:08,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94864 conditions, 35423 events. 20571/35423 cut-off events. For 35918/36995 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 257551 event pairs, 10082 based on Foata normal form. 305/33816 useless extension candidates. Maximal degree in co-relation 94751. Up to 19134 conditions per place. [2025-03-09 01:21:08,951 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 177 selfloop transitions, 14 changer transitions 0/222 dead transitions. [2025-03-09 01:21:08,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 222 transitions, 1351 flow [2025-03-09 01:21:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:21:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:21:08,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2025-03-09 01:21:08,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-03-09 01:21:08,953 INFO L175 Difference]: Start difference. First operand has 131 places, 127 transitions, 590 flow. Second operand 5 states and 438 transitions. [2025-03-09 01:21:08,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 222 transitions, 1351 flow [2025-03-09 01:21:09,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 222 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:09,088 INFO L231 Difference]: Finished difference. Result has 134 places, 127 transitions, 613 flow [2025-03-09 01:21:09,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=613, PETRI_PLACES=134, PETRI_TRANSITIONS=127} [2025-03-09 01:21:09,088 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 24 predicate places. [2025-03-09 01:21:09,088 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 127 transitions, 613 flow [2025-03-09 01:21:09,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.4) internal successors, (327), 5 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:21:09,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:09,089 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:09,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 01:21:09,089 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:21:09,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:09,089 INFO L85 PathProgramCache]: Analyzing trace with hash -221721959, now seen corresponding path program 1 times [2025-03-09 01:21:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:09,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372531209] [2025-03-09 01:21:09,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:09,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:09,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:21:09,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:21:09,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:09,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:21:09,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372531209] [2025-03-09 01:21:09,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372531209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482392737] [2025-03-09 01:21:09,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:09,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:09,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:09,350 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:21:09,351 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:21:09,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:21:09,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:21:09,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:09,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:09,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:21:09,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:21:09,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:21:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482392737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:21:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 12 [2025-03-09 01:21:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616035032] [2025-03-09 01:21:09,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:09,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:21:09,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:09,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:21:09,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:21:09,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 126 [2025-03-09 01:21:09,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 127 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:21:09,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:09,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 126 [2025-03-09 01:21:09,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:13,735 INFO L124 PetriNetUnfolderBase]: 26465/49248 cut-off events. [2025-03-09 01:21:13,736 INFO L125 PetriNetUnfolderBase]: For 74182/75826 co-relation queries the response was YES. [2025-03-09 01:21:13,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131469 conditions, 49248 events. 26465/49248 cut-off events. For 74182/75826 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 409178 event pairs, 13237 based on Foata normal form. 482/46345 useless extension candidates. Maximal degree in co-relation 131355. Up to 26269 conditions per place. [2025-03-09 01:21:14,348 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 295 selfloop transitions, 6 changer transitions 0/333 dead transitions. [2025-03-09 01:21:14,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 333 transitions, 2491 flow [2025-03-09 01:21:14,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:21:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:21:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 616 transitions. [2025-03-09 01:21:14,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6984126984126984 [2025-03-09 01:21:14,349 INFO L175 Difference]: Start difference. First operand has 134 places, 127 transitions, 613 flow. Second operand 7 states and 616 transitions. [2025-03-09 01:21:14,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 333 transitions, 2491 flow [2025-03-09 01:21:14,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 333 transitions, 2393 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:14,465 INFO L231 Difference]: Finished difference. Result has 141 places, 130 transitions, 630 flow [2025-03-09 01:21:14,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=630, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2025-03-09 01:21:14,466 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 31 predicate places. [2025-03-09 01:21:14,466 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 630 flow [2025-03-09 01:21:14,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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:21:14,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:14,466 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:14,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 01:21:14,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:14,667 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:21:14,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash 249218047, now seen corresponding path program 1 times [2025-03-09 01:21:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:14,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809177410] [2025-03-09 01:21:14,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:14,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:14,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:21:14,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:21:14,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:14,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:21:14,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809177410] [2025-03-09 01:21:14,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809177410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:14,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987215525] [2025-03-09 01:21:14,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:14,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:14,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:14,986 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:21:14,988 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:21:15,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:21:15,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:21:15,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:15,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:15,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-09 01:21:15,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:15,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:21:15,205 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:21:15,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:21:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:21:15,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:15,920 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:21:15,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987215525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:21:15,921 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:21:15,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 14, 9] total 30 [2025-03-09 01:21:15,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347560105] [2025-03-09 01:21:15,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:21:15,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:21:15,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:15,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:21:15,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:21:17,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 126 [2025-03-09 01:21:17,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 630 flow. Second operand has 32 states, 32 states have (on average 59.375) internal successors, (1900), 32 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states 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:21:17,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:17,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 126 [2025-03-09 01:21:17,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:27,989 INFO L124 PetriNetUnfolderBase]: 46839/87124 cut-off events. [2025-03-09 01:21:27,989 INFO L125 PetriNetUnfolderBase]: For 128936/133050 co-relation queries the response was YES. [2025-03-09 01:21:28,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249981 conditions, 87124 events. 46839/87124 cut-off events. For 128936/133050 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 766635 event pairs, 6713 based on Foata normal form. 1520/85704 useless extension candidates. Maximal degree in co-relation 249852. Up to 20484 conditions per place. [2025-03-09 01:21:28,747 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 300 selfloop transitions, 28 changer transitions 0/362 dead transitions. [2025-03-09 01:21:28,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 362 transitions, 2373 flow [2025-03-09 01:21:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:21:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 01:21:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1369 transitions. [2025-03-09 01:21:28,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5432539682539682 [2025-03-09 01:21:28,749 INFO L175 Difference]: Start difference. First operand has 141 places, 130 transitions, 630 flow. Second operand 20 states and 1369 transitions. [2025-03-09 01:21:28,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 362 transitions, 2373 flow [2025-03-09 01:21:28,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 362 transitions, 2352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:21:28,934 INFO L231 Difference]: Finished difference. Result has 163 places, 138 transitions, 791 flow [2025-03-09 01:21:28,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=791, PETRI_PLACES=163, PETRI_TRANSITIONS=138} [2025-03-09 01:21:28,934 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 53 predicate places. [2025-03-09 01:21:28,934 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 138 transitions, 791 flow [2025-03-09 01:21:28,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 59.375) internal successors, (1900), 32 states have internal predecessors, (1900), 0 states have call successors, (0), 0 states 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:21:28,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:28,935 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:28,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:21:29,138 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,SelfDestructingSolverStorable20 [2025-03-09 01:21:29,138 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:21:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1567084899, now seen corresponding path program 1 times [2025-03-09 01:21:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214951599] [2025-03-09 01:21:29,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:29,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-09 01:21:29,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:21:29,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:29,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:21:29,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:29,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214951599] [2025-03-09 01:21:29,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214951599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:29,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:29,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 01:21:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248925949] [2025-03-09 01:21:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:29,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:29,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:29,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:29,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:21:29,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 126 [2025-03-09 01:21:29,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 138 transitions, 791 flow. Second operand has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 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:21:29,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:29,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 126 [2025-03-09 01:21:29,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:39,883 INFO L124 PetriNetUnfolderBase]: 53041/95430 cut-off events. [2025-03-09 01:21:39,883 INFO L125 PetriNetUnfolderBase]: For 185265/189586 co-relation queries the response was YES. [2025-03-09 01:21:40,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274481 conditions, 95430 events. 53041/95430 cut-off events. For 185265/189586 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 824403 event pairs, 22002 based on Foata normal form. 1102/92304 useless extension candidates. Maximal degree in co-relation 274381. Up to 43397 conditions per place. [2025-03-09 01:21:40,657 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 281 selfloop transitions, 11 changer transitions 0/323 dead transitions. [2025-03-09 01:21:40,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 323 transitions, 2748 flow [2025-03-09 01:21:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:21:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:21:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 524 transitions. [2025-03-09 01:21:40,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6931216931216931 [2025-03-09 01:21:40,658 INFO L175 Difference]: Start difference. First operand has 163 places, 138 transitions, 791 flow. Second operand 6 states and 524 transitions. [2025-03-09 01:21:40,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 323 transitions, 2748 flow [2025-03-09 01:21:41,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 323 transitions, 2710 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:21:41,066 INFO L231 Difference]: Finished difference. Result has 163 places, 141 transitions, 810 flow [2025-03-09 01:21:41,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=810, PETRI_PLACES=163, PETRI_TRANSITIONS=141} [2025-03-09 01:21:41,066 INFO L279 CegarLoopForPetriNet]: 110 programPoint places, 53 predicate places. [2025-03-09 01:21:41,066 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 141 transitions, 810 flow [2025-03-09 01:21:41,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 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:21:41,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:41,066 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:21:41,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:21:41,067 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2025-03-09 01:21:41,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:41,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2089428773, now seen corresponding path program 1 times [2025-03-09 01:21:41,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:41,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311199991] [2025-03-09 01:21:41,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:41,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:41,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:21:41,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:21:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:21:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311199991] [2025-03-09 01:21:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311199991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042417187] [2025-03-09 01:21:41,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:21:41,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:21:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:21:41,325 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:21:41,327 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:21:41,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:21:41,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:21:41,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:41,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:41,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:21:41,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:21:41,503 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:21:41,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:21:41,551 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:21:41,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042417187] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:21:41,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:21:41,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 16 [2025-03-09 01:21:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116422813] [2025-03-09 01:21:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:41,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:21:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:41,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:21:41,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:21:41,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 126 [2025-03-09 01:21:41,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 141 transitions, 810 flow. Second operand has 5 states, 5 states have (on average 67.6) internal successors, (338), 5 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:21:41,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:41,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 126 [2025-03-09 01:21:41,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand