./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.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 c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:07:18,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:07:18,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:07:18,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:07:18,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:07:18,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:07:18,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:07:18,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:07:18,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:07:18,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:07:18,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:07:18,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:07:18,230 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:07:18,231 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:18,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:07:18,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:07:18,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:07:18,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:07:18,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:07:18,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:07:18,234 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-03-04 10:07:18,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:07:18,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:07:18,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:07:18,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:07:18,486 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:07:18,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-04 10:07:19,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8cf2efb/f65f2bb6dd3e4bdd92e03830004e51dd/FLAG9d4420299 [2025-03-04 10:07:19,910 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:07:19,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-03-04 10:07:19,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8cf2efb/f65f2bb6dd3e4bdd92e03830004e51dd/FLAG9d4420299 [2025-03-04 10:07:20,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf8cf2efb/f65f2bb6dd3e4bdd92e03830004e51dd [2025-03-04 10:07:20,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:07:20,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:07:20,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:20,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:07:20,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:07:20,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4f0e18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20, skipping insertion in model container [2025-03-04 10:07:20,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:07:20,370 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:07:20,376 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:07:20,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:20,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:07:20,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:07:20,431 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:07:20,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20 WrapperNode [2025-03-04 10:07:20,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:07:20,432 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:20,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:07:20,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:07:20,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,467 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 408 [2025-03-04 10:07:20,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:07:20,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:07:20,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:07:20,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:07:20,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,497 INFO L175 MemorySlicer]: Split 26 memory accesses to 3 slices as follows [2, 15, 9]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-04 10:07:20,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:07:20,516 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:07:20,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:07:20,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:07:20,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (1/1) ... [2025-03-04 10:07:20,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:07:20,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:20,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:07:20,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:07:20,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:07:20,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:07:20,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:07:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:07:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:07:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:07:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:07:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:07:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:07:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:07:20,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:07:20,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:07:20,570 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:07:20,671 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:07:20,673 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:07:21,242 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:07:21,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:07:21,552 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:07:21,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:07:21,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:21 BoogieIcfgContainer [2025-03-04 10:07:21,553 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:07:21,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:07:21,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:07:21,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:07:21,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:07:20" (1/3) ... [2025-03-04 10:07:21,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2583a9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:21, skipping insertion in model container [2025-03-04 10:07:21,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:07:20" (2/3) ... [2025-03-04 10:07:21,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2583a9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:07:21, skipping insertion in model container [2025-03-04 10:07:21,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:07:21" (3/3) ... [2025-03-04 10:07:21,560 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-03-04 10:07:21,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:07:21,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 109 locations, 1 initial locations, 6 loop locations, and 50 error locations. [2025-03-04 10:07:21,577 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:07:21,644 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:07:21,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 261 flow [2025-03-04 10:07:21,719 INFO L124 PetriNetUnfolderBase]: 12/117 cut-off events. [2025-03-04 10:07:21,722 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:07:21,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 12/117 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 385 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2025-03-04 10:07:21,729 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 120 transitions, 261 flow [2025-03-04 10:07:21,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 116 transitions, 250 flow [2025-03-04 10:07:21,742 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:07:21,753 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;@19730d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:07:21,753 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-03-04 10:07:21,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:07:21,759 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:07:21,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:07:21,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:21,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:21,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:21,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:21,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1218081, now seen corresponding path program 1 times [2025-03-04 10:07:21,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:21,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720146266] [2025-03-04 10:07:21,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:21,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:21,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:21,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:21,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:21,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:21,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720146266] [2025-03-04 10:07:21,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720146266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:22,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:07:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097438592] [2025-03-04 10:07:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:22,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:22,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:22,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:22,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:22,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:22,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:22,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:22,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:22,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:22,728 INFO L124 PetriNetUnfolderBase]: 2263/4993 cut-off events. [2025-03-04 10:07:22,728 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-03-04 10:07:22,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8166 conditions, 4993 events. 2263/4993 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40782 event pairs, 1414 based on Foata normal form. 1/3839 useless extension candidates. Maximal degree in co-relation 7651. Up to 3012 conditions per place. [2025-03-04 10:07:22,779 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 48 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 10:07:22,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 340 flow [2025-03-04 10:07:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:22,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:22,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-03-04 10:07:22,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-03-04 10:07:22,795 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 250 flow. Second operand 3 states and 249 transitions. [2025-03-04 10:07:22,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 340 flow [2025-03-04 10:07:22,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 328 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:22,806 INFO L231 Difference]: Finished difference. Result has 105 places, 111 transitions, 232 flow [2025-03-04 10:07:22,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=105, PETRI_TRANSITIONS=111} [2025-03-04 10:07:22,810 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -9 predicate places. [2025-03-04 10:07:22,810 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 111 transitions, 232 flow [2025-03-04 10:07:22,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:22,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:22,811 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:07:22,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:07:22,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:22,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1218082, now seen corresponding path program 1 times [2025-03-04 10:07:22,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:22,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298023326] [2025-03-04 10:07:22,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:22,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:22,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:07:22,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:07:22,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:22,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298023326] [2025-03-04 10:07:23,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298023326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:23,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:23,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701099528] [2025-03-04 10:07:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:23,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:23,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:23,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:23,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:23,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 111 transitions, 232 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:23,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:23,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:23,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:23,707 INFO L124 PetriNetUnfolderBase]: 2263/4995 cut-off events. [2025-03-04 10:07:23,707 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 10:07:23,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8073 conditions, 4995 events. 2263/4995 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40852 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8038. Up to 3024 conditions per place. [2025-03-04 10:07:23,740 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 53 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-04 10:07:23,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 113 transitions, 346 flow [2025-03-04 10:07:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-03-04 10:07:23,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2025-03-04 10:07:23,744 INFO L175 Difference]: Start difference. First operand has 105 places, 111 transitions, 232 flow. Second operand 3 states and 252 transitions. [2025-03-04 10:07:23,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 113 transitions, 346 flow [2025-03-04 10:07:23,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:23,747 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 242 flow [2025-03-04 10:07:23,747 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2025-03-04 10:07:23,748 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -8 predicate places. [2025-03-04 10:07:23,748 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 242 flow [2025-03-04 10:07:23,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:23,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:23,749 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:07:23,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:07:23,750 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:23,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1170614776, now seen corresponding path program 1 times [2025-03-04 10:07:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:23,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337555311] [2025-03-04 10:07:23,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:23,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:23,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:23,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:23,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:24,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337555311] [2025-03-04 10:07:24,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337555311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:24,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632162827] [2025-03-04 10:07:24,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:24,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:24,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:24,016 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:24,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:07:24,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:07:24,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:07:24,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:24,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:24,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:07:24,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:24,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:07:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:24,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:07:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632162827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:24,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:24,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:07:24,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405390095] [2025-03-04 10:07:24,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:24,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:07:24,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:24,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:07:24,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:07:24,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:24,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 242 flow. Second operand has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:24,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:24,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:24,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:25,446 INFO L124 PetriNetUnfolderBase]: 2263/4994 cut-off events. [2025-03-04 10:07:25,446 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 10:07:25,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8075 conditions, 4994 events. 2263/4994 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40885 event pairs, 1414 based on Foata normal form. 0/3838 useless extension candidates. Maximal degree in co-relation 8062. Up to 3018 conditions per place. [2025-03-04 10:07:25,477 INFO L140 encePairwiseOnDemand]: 113/120 looper letters, 47 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-03-04 10:07:25,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 348 flow [2025-03-04 10:07:25,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:07:25,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:07:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 445 transitions. [2025-03-04 10:07:25,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6180555555555556 [2025-03-04 10:07:25,480 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 242 flow. Second operand 6 states and 445 transitions. [2025-03-04 10:07:25,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 348 flow [2025-03-04 10:07:25,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:25,482 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 258 flow [2025-03-04 10:07:25,482 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2025-03-04 10:07:25,484 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -4 predicate places. [2025-03-04 10:07:25,484 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 258 flow [2025-03-04 10:07:25,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 66.36363636363636) internal successors, (730), 11 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:25,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:25,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:07:25,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:25,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:25,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:25,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1929322272, now seen corresponding path program 1 times [2025-03-04 10:07:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:25,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967619553] [2025-03-04 10:07:25,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:25,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:07:25,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:07:25,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:25,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967619553] [2025-03-04 10:07:25,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967619553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:25,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:25,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:25,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477411392] [2025-03-04 10:07:25,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:25,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:25,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:25,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:25,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:26,001 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:26,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 258 flow. Second operand has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:26,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:26,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:26,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:26,491 INFO L124 PetriNetUnfolderBase]: 2264/4997 cut-off events. [2025-03-04 10:07:26,492 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:07:26,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 4997 events. 2264/4997 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40896 event pairs, 1414 based on Foata normal form. 1/3843 useless extension candidates. Maximal degree in co-relation 8062. Up to 3023 conditions per place. [2025-03-04 10:07:26,520 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 52 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-03-04 10:07:26,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 378 flow [2025-03-04 10:07:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2025-03-04 10:07:26,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-03-04 10:07:26,522 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 258 flow. Second operand 4 states and 318 transitions. [2025-03-04 10:07:26,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 378 flow [2025-03-04 10:07:26,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 366 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:26,527 INFO L231 Difference]: Finished difference. Result has 111 places, 114 transitions, 271 flow [2025-03-04 10:07:26,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=271, PETRI_PLACES=111, PETRI_TRANSITIONS=114} [2025-03-04 10:07:26,529 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -3 predicate places. [2025-03-04 10:07:26,529 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 114 transitions, 271 flow [2025-03-04 10:07:26,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.2) internal successors, (331), 5 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:26,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:26,529 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:26,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:07:26,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:26,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash -320547379, now seen corresponding path program 1 times [2025-03-04 10:07:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:26,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199024610] [2025-03-04 10:07:26,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:26,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:07:26,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:07:26,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:26,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:26,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:26,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199024610] [2025-03-04 10:07:26,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199024610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:26,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:26,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842219756] [2025-03-04 10:07:26,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:26,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:26,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:26,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:26,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:26,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 114 transitions, 271 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:26,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:26,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:26,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:26,953 INFO L124 PetriNetUnfolderBase]: 2263/4996 cut-off events. [2025-03-04 10:07:26,953 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 10:07:26,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 4996 events. 2263/4996 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40866 event pairs, 1414 based on Foata normal form. 1/3844 useless extension candidates. Maximal degree in co-relation 8063. Up to 3020 conditions per place. [2025-03-04 10:07:26,979 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 50 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-03-04 10:07:26,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 376 flow [2025-03-04 10:07:26,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:26,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-03-04 10:07:26,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-03-04 10:07:26,981 INFO L175 Difference]: Start difference. First operand has 111 places, 114 transitions, 271 flow. Second operand 4 states and 327 transitions. [2025-03-04 10:07:26,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 376 flow [2025-03-04 10:07:26,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:26,983 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 270 flow [2025-03-04 10:07:26,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=270, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-04 10:07:26,983 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -2 predicate places. [2025-03-04 10:07:26,984 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 270 flow [2025-03-04 10:07:26,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:26,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:26,984 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:26,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:07:26,984 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:26,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:26,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1347131331, now seen corresponding path program 1 times [2025-03-04 10:07:26,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:26,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095778922] [2025-03-04 10:07:26,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:26,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:26,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:07:27,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:07:27,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:27,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:27,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:27,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095778922] [2025-03-04 10:07:27,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095778922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:27,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147892898] [2025-03-04 10:07:27,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:27,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:27,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:27,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:07:27,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:07:27,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:07:27,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:27,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:27,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:07:27,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:27,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147892898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:27,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:27,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:07:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609311116] [2025-03-04 10:07:27,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:27,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:07:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:27,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:07:27,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:07:28,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:28,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 270 flow. Second operand has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:28,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:28,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:28,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:28,704 INFO L124 PetriNetUnfolderBase]: 2265/5001 cut-off events. [2025-03-04 10:07:28,704 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:28,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8111 conditions, 5001 events. 2265/5001 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40853 event pairs, 1414 based on Foata normal form. 0/3847 useless extension candidates. Maximal degree in co-relation 8069. Up to 3016 conditions per place. [2025-03-04 10:07:28,720 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 45 selfloop transitions, 16 changer transitions 0/119 dead transitions. [2025-03-04 10:07:28,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 119 transitions, 417 flow [2025-03-04 10:07:28,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:28,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:28,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 648 transitions. [2025-03-04 10:07:28,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:07:28,725 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 270 flow. Second operand 9 states and 648 transitions. [2025-03-04 10:07:28,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 119 transitions, 417 flow [2025-03-04 10:07:28,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 119 transitions, 407 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:28,727 INFO L231 Difference]: Finished difference. Result has 116 places, 119 transitions, 317 flow [2025-03-04 10:07:28,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=317, PETRI_PLACES=116, PETRI_TRANSITIONS=119} [2025-03-04 10:07:28,727 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 2 predicate places. [2025-03-04 10:07:28,728 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 119 transitions, 317 flow [2025-03-04 10:07:28,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 66.61538461538461) internal successors, (866), 13 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:28,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:28,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:28,736 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-04 10:07:28,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:07:28,937 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:28,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:28,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1188606032, now seen corresponding path program 1 times [2025-03-04 10:07:28,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:28,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822951440] [2025-03-04 10:07:28,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:28,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:07:28,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:07:28,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:28,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:29,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822951440] [2025-03-04 10:07:29,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822951440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:29,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:29,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:29,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224962367] [2025-03-04 10:07:29,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:29,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:07:29,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:29,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:07:29,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:07:29,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:29,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 119 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:29,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:29,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:29,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:29,574 INFO L124 PetriNetUnfolderBase]: 2265/5003 cut-off events. [2025-03-04 10:07:29,575 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 10:07:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8126 conditions, 5003 events. 2265/5003 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40872 event pairs, 1414 based on Foata normal form. 0/3849 useless extension candidates. Maximal degree in co-relation 8080. Up to 3028 conditions per place. [2025-03-04 10:07:29,592 INFO L140 encePairwiseOnDemand]: 114/120 looper letters, 58 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2025-03-04 10:07:29,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 447 flow [2025-03-04 10:07:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-04 10:07:29,597 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-04 10:07:29,598 INFO L175 Difference]: Start difference. First operand has 116 places, 119 transitions, 317 flow. Second operand 4 states and 317 transitions. [2025-03-04 10:07:29,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 447 flow [2025-03-04 10:07:29,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 121 transitions, 428 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:29,600 INFO L231 Difference]: Finished difference. Result has 117 places, 120 transitions, 321 flow [2025-03-04 10:07:29,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=117, PETRI_TRANSITIONS=120} [2025-03-04 10:07:29,602 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 3 predicate places. [2025-03-04 10:07:29,602 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 120 transitions, 321 flow [2025-03-04 10:07:29,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:29,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:29,603 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:29,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:07:29,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash -210864714, now seen corresponding path program 1 times [2025-03-04 10:07:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:29,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635140104] [2025-03-04 10:07:29,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:29,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:07:29,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:07:29,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:29,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:29,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635140104] [2025-03-04 10:07:29,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635140104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:29,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718281227] [2025-03-04 10:07:29,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:29,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:29,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:29,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:29,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:07:29,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:07:29,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:07:29,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:29,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:29,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:07:29,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:29,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:30,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:30,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718281227] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:30,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:30,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:07:30,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961616315] [2025-03-04 10:07:30,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:30,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:07:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:30,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:07:30,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:07:30,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:30,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 321 flow. Second operand has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:30,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:30,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:30,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:31,195 INFO L124 PetriNetUnfolderBase]: 2266/5005 cut-off events. [2025-03-04 10:07:31,195 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:31,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8131 conditions, 5005 events. 2266/5005 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40812 event pairs, 1414 based on Foata normal form. 0/3851 useless extension candidates. Maximal degree in co-relation 8086. Up to 3020 conditions per place. [2025-03-04 10:07:31,218 INFO L140 encePairwiseOnDemand]: 111/120 looper letters, 47 selfloop transitions, 18 changer transitions 0/123 dead transitions. [2025-03-04 10:07:31,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 123 transitions, 458 flow [2025-03-04 10:07:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 647 transitions. [2025-03-04 10:07:31,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990740740740741 [2025-03-04 10:07:31,220 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 321 flow. Second operand 9 states and 647 transitions. [2025-03-04 10:07:31,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 123 transitions, 458 flow [2025-03-04 10:07:31,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 123 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:31,223 INFO L231 Difference]: Finished difference. Result has 121 places, 123 transitions, 359 flow [2025-03-04 10:07:31,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=121, PETRI_TRANSITIONS=123} [2025-03-04 10:07:31,224 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2025-03-04 10:07:31,226 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 123 transitions, 359 flow [2025-03-04 10:07:31,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 67.07692307692308) internal successors, (872), 13 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:31,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:31,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:31,233 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-04 10:07:31,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:31,427 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:31,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2053131108, now seen corresponding path program 1 times [2025-03-04 10:07:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:31,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320078372] [2025-03-04 10:07:31,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:31,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:07:31,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:07:31,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:31,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320078372] [2025-03-04 10:07:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320078372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281570500] [2025-03-04 10:07:31,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:31,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:31,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:07:31,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:07:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:07:31,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:31,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:07:31,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:31,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:31,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:31,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281570500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:31,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:31,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:07:31,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745840563] [2025-03-04 10:07:31,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:31,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:31,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:31,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:07:31,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:31,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 123 transitions, 359 flow. Second operand has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:31,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:31,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:31,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:32,067 INFO L124 PetriNetUnfolderBase]: 2267/5009 cut-off events. [2025-03-04 10:07:32,067 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-04 10:07:32,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8157 conditions, 5009 events. 2267/5009 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40876 event pairs, 1414 based on Foata normal form. 0/3854 useless extension candidates. Maximal degree in co-relation 8105. Up to 3038 conditions per place. [2025-03-04 10:07:32,088 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 66 selfloop transitions, 5 changer transitions 0/126 dead transitions. [2025-03-04 10:07:32,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 126 transitions, 507 flow [2025-03-04 10:07:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-04 10:07:32,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-04 10:07:32,090 INFO L175 Difference]: Start difference. First operand has 121 places, 123 transitions, 359 flow. Second operand 4 states and 317 transitions. [2025-03-04 10:07:32,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 126 transitions, 507 flow [2025-03-04 10:07:32,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 126 transitions, 482 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 10:07:32,092 INFO L231 Difference]: Finished difference. Result has 121 places, 125 transitions, 358 flow [2025-03-04 10:07:32,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=121, PETRI_TRANSITIONS=125} [2025-03-04 10:07:32,092 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2025-03-04 10:07:32,092 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 125 transitions, 358 flow [2025-03-04 10:07:32,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:32,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:32,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:32,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:32,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:32,294 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:32,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2053131107, now seen corresponding path program 1 times [2025-03-04 10:07:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:32,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946977276] [2025-03-04 10:07:32,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:32,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:07:32,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:07:32,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:32,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946977276] [2025-03-04 10:07:32,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946977276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:32,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:32,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:07:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003186429] [2025-03-04 10:07:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:32,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:07:32,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:32,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:07:32,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:07:32,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:32,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 125 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:32,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:32,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:32,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:32,627 INFO L124 PetriNetUnfolderBase]: 2267/5005 cut-off events. [2025-03-04 10:07:32,628 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:32,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8147 conditions, 5005 events. 2267/5005 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40850 event pairs, 1414 based on Foata normal form. 2/3855 useless extension candidates. Maximal degree in co-relation 8098. Up to 3026 conditions per place. [2025-03-04 10:07:32,647 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 64 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2025-03-04 10:07:32,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 122 transitions, 486 flow [2025-03-04 10:07:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:32,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-04 10:07:32,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-03-04 10:07:32,648 INFO L175 Difference]: Start difference. First operand has 121 places, 125 transitions, 358 flow. Second operand 3 states and 248 transitions. [2025-03-04 10:07:32,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 122 transitions, 486 flow [2025-03-04 10:07:32,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 122 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:32,650 INFO L231 Difference]: Finished difference. Result has 118 places, 122 transitions, 352 flow [2025-03-04 10:07:32,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=118, PETRI_TRANSITIONS=122} [2025-03-04 10:07:32,650 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 4 predicate places. [2025-03-04 10:07:32,650 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 122 transitions, 352 flow [2025-03-04 10:07:32,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:32,651 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:32,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:07:32,651 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:32,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash -777442915, now seen corresponding path program 1 times [2025-03-04 10:07:32,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:32,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370310002] [2025-03-04 10:07:32,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:32,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:07:32,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:07:32,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:32,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:32,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:32,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370310002] [2025-03-04 10:07:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370310002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:32,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:32,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:32,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681593011] [2025-03-04 10:07:32,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:32,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:32,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:32,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:32,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:32,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:32,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:32,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:32,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:33,063 INFO L124 PetriNetUnfolderBase]: 2266/5004 cut-off events. [2025-03-04 10:07:33,063 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-04 10:07:33,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 5004 events. 2266/5004 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 40854 event pairs, 1414 based on Foata normal form. 1/3854 useless extension candidates. Maximal degree in co-relation 8096. Up to 3034 conditions per place. [2025-03-04 10:07:33,087 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 63 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2025-03-04 10:07:33,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 484 flow [2025-03-04 10:07:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:33,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-04 10:07:33,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-04 10:07:33,088 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 352 flow. Second operand 4 states and 325 transitions. [2025-03-04 10:07:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 484 flow [2025-03-04 10:07:33,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 122 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:33,090 INFO L231 Difference]: Finished difference. Result has 119 places, 121 transitions, 350 flow [2025-03-04 10:07:33,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=119, PETRI_TRANSITIONS=121} [2025-03-04 10:07:33,091 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2025-03-04 10:07:33,091 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 121 transitions, 350 flow [2025-03-04 10:07:33,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:33,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:33,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:33,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:07:33,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:33,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:33,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1669043914, now seen corresponding path program 1 times [2025-03-04 10:07:33,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:33,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816303799] [2025-03-04 10:07:33,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:33,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:33,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:07:33,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:07:33,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:33,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:33,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:33,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:33,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816303799] [2025-03-04 10:07:33,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816303799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:33,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921204714] [2025-03-04 10:07:33,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:33,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:33,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:33,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:33,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:07:33,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:07:33,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:07:33,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:33,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:33,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:07:33,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:33,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:33,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921204714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:33,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:33,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:07:33,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594981609] [2025-03-04 10:07:33,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:33,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:33,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:33,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:33,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:33,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:33,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 121 transitions, 350 flow. Second operand has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:33,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:33,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:33,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:34,132 INFO L124 PetriNetUnfolderBase]: 4460/9788 cut-off events. [2025-03-04 10:07:34,132 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 10:07:34,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15944 conditions, 9788 events. 4460/9788 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 89607 event pairs, 2808 based on Foata normal form. 1/7627 useless extension candidates. Maximal degree in co-relation 8089. Up to 3008 conditions per place. [2025-03-04 10:07:34,175 INFO L140 encePairwiseOnDemand]: 108/120 looper letters, 88 selfloop transitions, 34 changer transitions 0/177 dead transitions. [2025-03-04 10:07:34,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 177 transitions, 758 flow [2025-03-04 10:07:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:07:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:07:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 782 transitions. [2025-03-04 10:07:34,177 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6516666666666666 [2025-03-04 10:07:34,177 INFO L175 Difference]: Start difference. First operand has 119 places, 121 transitions, 350 flow. Second operand 10 states and 782 transitions. [2025-03-04 10:07:34,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 177 transitions, 758 flow [2025-03-04 10:07:34,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 177 transitions, 744 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:34,180 INFO L231 Difference]: Finished difference. Result has 128 places, 137 transitions, 506 flow [2025-03-04 10:07:34,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=506, PETRI_PLACES=128, PETRI_TRANSITIONS=137} [2025-03-04 10:07:34,180 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 14 predicate places. [2025-03-04 10:07:34,180 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 137 transitions, 506 flow [2025-03-04 10:07:34,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.0) internal successors, (980), 14 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:34,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:34,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:34,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:34,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:07:34,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:34,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:34,381 INFO L85 PathProgramCache]: Analyzing trace with hash 200755959, now seen corresponding path program 1 times [2025-03-04 10:07:34,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:34,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354038237] [2025-03-04 10:07:34,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:34,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:34,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:07:34,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:07:34,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:34,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:34,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:34,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354038237] [2025-03-04 10:07:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354038237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:34,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880539649] [2025-03-04 10:07:34,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:34,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:34,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:34,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:34,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:07:34,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:07:34,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:07:34,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:34,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:34,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:07:34,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:34,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:34,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880539649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-04 10:07:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971771745] [2025-03-04 10:07:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:34,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:34,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:34,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:34,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:07:34,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:34,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 137 transitions, 506 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:34,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:34,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:34,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:35,333 INFO L124 PetriNetUnfolderBase]: 4530/10002 cut-off events. [2025-03-04 10:07:35,333 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-03-04 10:07:35,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16298 conditions, 10002 events. 4530/10002 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91853 event pairs, 2828 based on Foata normal form. 0/7699 useless extension candidates. Maximal degree in co-relation 8121. Up to 6070 conditions per place. [2025-03-04 10:07:35,369 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 83 selfloop transitions, 5 changer transitions 0/140 dead transitions. [2025-03-04 10:07:35,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 140 transitions, 688 flow [2025-03-04 10:07:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:35,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2025-03-04 10:07:35,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6604166666666667 [2025-03-04 10:07:35,371 INFO L175 Difference]: Start difference. First operand has 128 places, 137 transitions, 506 flow. Second operand 4 states and 317 transitions. [2025-03-04 10:07:35,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 140 transitions, 688 flow [2025-03-04 10:07:35,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 140 transitions, 684 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 10:07:35,373 INFO L231 Difference]: Finished difference. Result has 131 places, 139 transitions, 526 flow [2025-03-04 10:07:35,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=131, PETRI_TRANSITIONS=139} [2025-03-04 10:07:35,374 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 17 predicate places. [2025-03-04 10:07:35,374 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 139 transitions, 526 flow [2025-03-04 10:07:35,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:35,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:35,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:35,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:35,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:35,578 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:35,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1928469381, now seen corresponding path program 1 times [2025-03-04 10:07:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:35,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610153661] [2025-03-04 10:07:35,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:35,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:07:35,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:35,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:35,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:35,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:35,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610153661] [2025-03-04 10:07:35,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610153661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:35,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:35,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:35,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076787168] [2025-03-04 10:07:35,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:35,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:35,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:35,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:35,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:35,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:35,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 139 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:35,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:35,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:35,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:36,225 INFO L124 PetriNetUnfolderBase]: 4528/10000 cut-off events. [2025-03-04 10:07:36,225 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-03-04 10:07:36,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16302 conditions, 10000 events. 4528/10000 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 91822 event pairs, 2828 based on Foata normal form. 2/7708 useless extension candidates. Maximal degree in co-relation 8122. Up to 6063 conditions per place. [2025-03-04 10:07:36,276 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 80 selfloop transitions, 4 changer transitions 0/139 dead transitions. [2025-03-04 10:07:36,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 139 transitions, 691 flow [2025-03-04 10:07:36,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-04 10:07:36,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-04 10:07:36,278 INFO L175 Difference]: Start difference. First operand has 131 places, 139 transitions, 526 flow. Second operand 4 states and 325 transitions. [2025-03-04 10:07:36,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 139 transitions, 691 flow [2025-03-04 10:07:36,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 686 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:36,280 INFO L231 Difference]: Finished difference. Result has 132 places, 138 transitions, 524 flow [2025-03-04 10:07:36,281 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=132, PETRI_TRANSITIONS=138} [2025-03-04 10:07:36,281 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 18 predicate places. [2025-03-04 10:07:36,282 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 138 transitions, 524 flow [2025-03-04 10:07:36,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:36,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:36,282 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:36,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 10:07:36,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:36,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash 274620724, now seen corresponding path program 2 times [2025-03-04 10:07:36,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:36,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140018743] [2025-03-04 10:07:36,283 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:36,292 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:07:36,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:36,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:36,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:36,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:36,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140018743] [2025-03-04 10:07:36,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140018743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:36,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875616366] [2025-03-04 10:07:36,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:36,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:36,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:36,461 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:36,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:07:36,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 10:07:36,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:07:36,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:36,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:36,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:07:36,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:36,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-04 10:07:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:36,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875616366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:36,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:36,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 18 [2025-03-04 10:07:36,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933952204] [2025-03-04 10:07:36,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:36,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:07:36,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:36,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:07:36,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:07:37,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:37,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 138 transitions, 524 flow. Second operand has 20 states, 20 states have (on average 67.3) internal successors, (1346), 20 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:37,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:37,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:37,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:38,915 INFO L124 PetriNetUnfolderBase]: 6725/14793 cut-off events. [2025-03-04 10:07:38,915 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-04 10:07:38,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24167 conditions, 14793 events. 6725/14793 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 143971 event pairs, 4222 based on Foata normal form. 0/11486 useless extension candidates. Maximal degree in co-relation 8134. Up to 6055 conditions per place. [2025-03-04 10:07:39,008 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 126 selfloop transitions, 27 changer transitions 0/205 dead transitions. [2025-03-04 10:07:39,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 205 transitions, 1097 flow [2025-03-04 10:07:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:07:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:07:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1223 transitions. [2025-03-04 10:07:39,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5995098039215686 [2025-03-04 10:07:39,012 INFO L175 Difference]: Start difference. First operand has 132 places, 138 transitions, 524 flow. Second operand 17 states and 1223 transitions. [2025-03-04 10:07:39,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 205 transitions, 1097 flow [2025-03-04 10:07:39,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 205 transitions, 1083 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:07:39,016 INFO L231 Difference]: Finished difference. Result has 145 places, 150 transitions, 651 flow [2025-03-04 10:07:39,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=651, PETRI_PLACES=145, PETRI_TRANSITIONS=150} [2025-03-04 10:07:39,016 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 31 predicate places. [2025-03-04 10:07:39,016 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 150 transitions, 651 flow [2025-03-04 10:07:39,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 67.3) internal successors, (1346), 20 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:39,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:39,017 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:39,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:39,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:39,221 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:39,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash -347012561, now seen corresponding path program 1 times [2025-03-04 10:07:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607194509] [2025-03-04 10:07:39,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:39,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:39,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:07:39,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:07:39,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:39,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:39,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:39,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607194509] [2025-03-04 10:07:39,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607194509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:39,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820704351] [2025-03-04 10:07:39,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:39,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:39,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:39,337 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:39,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:07:39,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:07:39,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:07:39,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:39,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:39,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:07:39,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:39,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:39,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:07:39,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820704351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:39,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:39,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:07:39,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460452847] [2025-03-04 10:07:39,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:39,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:39,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:39,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:39,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:39,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:39,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 150 transitions, 651 flow. Second operand has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:39,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:39,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:39,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:41,385 INFO L124 PetriNetUnfolderBase]: 13369/29333 cut-off events. [2025-03-04 10:07:41,386 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2025-03-04 10:07:41,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47876 conditions, 29333 events. 13369/29333 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 316741 event pairs, 8424 based on Foata normal form. 3/22874 useless extension candidates. Maximal degree in co-relation 15949. Up to 9042 conditions per place. [2025-03-04 10:07:41,563 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 119 selfloop transitions, 47 changer transitions 0/220 dead transitions. [2025-03-04 10:07:41,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 220 transitions, 1316 flow [2025-03-04 10:07:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 713 transitions. [2025-03-04 10:07:41,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6601851851851852 [2025-03-04 10:07:41,565 INFO L175 Difference]: Start difference. First operand has 145 places, 150 transitions, 651 flow. Second operand 9 states and 713 transitions. [2025-03-04 10:07:41,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 220 transitions, 1316 flow [2025-03-04 10:07:41,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 220 transitions, 1150 flow, removed 30 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:41,569 INFO L231 Difference]: Finished difference. Result has 150 places, 168 transitions, 838 flow [2025-03-04 10:07:41,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=838, PETRI_PLACES=150, PETRI_TRANSITIONS=168} [2025-03-04 10:07:41,570 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 36 predicate places. [2025-03-04 10:07:41,570 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 168 transitions, 838 flow [2025-03-04 10:07:41,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.21428571428571) internal successors, (983), 14 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:41,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:41,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:41,579 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-04 10:07:41,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:07:41,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2127514445, now seen corresponding path program 1 times [2025-03-04 10:07:41,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:41,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351620640] [2025-03-04 10:07:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:41,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:07:41,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:07:41,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:41,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351620640] [2025-03-04 10:07:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351620640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:42,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290726889] [2025-03-04 10:07:42,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:42,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:42,050 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:42,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:07:42,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:07:42,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:07:42,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:42,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:42,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:07:42,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:42,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:07:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:42,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:42,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290726889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:42,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:42,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-04 10:07:42,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888335984] [2025-03-04 10:07:42,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:42,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:42,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:42,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:42,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:07:42,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 120 [2025-03-04 10:07:42,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 168 transitions, 838 flow. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:42,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:42,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 120 [2025-03-04 10:07:42,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:44,449 INFO L124 PetriNetUnfolderBase]: 13579/29975 cut-off events. [2025-03-04 10:07:44,449 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-03-04 10:07:44,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48831 conditions, 29975 events. 13579/29975 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 325546 event pairs, 8484 based on Foata normal form. 0/23078 useless extension candidates. Maximal degree in co-relation 16575. Up to 18179 conditions per place. [2025-03-04 10:07:44,606 INFO L140 encePairwiseOnDemand]: 115/120 looper letters, 114 selfloop transitions, 5 changer transitions 0/171 dead transitions. [2025-03-04 10:07:44,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 171 transitions, 1082 flow [2025-03-04 10:07:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:07:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:07:44,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 316 transitions. [2025-03-04 10:07:44,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-04 10:07:44,607 INFO L175 Difference]: Start difference. First operand has 150 places, 168 transitions, 838 flow. Second operand 4 states and 316 transitions. [2025-03-04 10:07:44,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 171 transitions, 1082 flow [2025-03-04 10:07:44,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 171 transitions, 1080 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 10:07:44,613 INFO L231 Difference]: Finished difference. Result has 154 places, 170 transitions, 860 flow [2025-03-04 10:07:44,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=154, PETRI_TRANSITIONS=170} [2025-03-04 10:07:44,614 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 40 predicate places. [2025-03-04 10:07:44,614 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 170 transitions, 860 flow [2025-03-04 10:07:44,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:44,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:44,614 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:44,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:44,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:07:44,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:44,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1564224270, now seen corresponding path program 2 times [2025-03-04 10:07:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012374611] [2025-03-04 10:07:44,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:44,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:07:44,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:07:44,839 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:44,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:45,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012374611] [2025-03-04 10:07:45,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012374611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259359791] [2025-03-04 10:07:45,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:45,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:45,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:45,025 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:45,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:07:45,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:07:45,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:07:45,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:45,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:45,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 10:07:45,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:45,218 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 12 treesize of output 11 [2025-03-04 10:07:45,261 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 17 treesize of output 13 [2025-03-04 10:07:45,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:45,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2025-03-04 10:07:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:45,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:07:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259359791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:45,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-04 10:07:45,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117748203] [2025-03-04 10:07:45,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:45,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:07:45,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:45,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:07:45,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:07:46,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 120 [2025-03-04 10:07:46,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 170 transitions, 860 flow. Second operand has 19 states, 19 states have (on average 64.6842105263158) internal successors, (1229), 19 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:46,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:46,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 120 [2025-03-04 10:07:46,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:50,553 INFO L124 PetriNetUnfolderBase]: 19966/43725 cut-off events. [2025-03-04 10:07:50,553 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-03-04 10:07:50,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71581 conditions, 43725 events. 19966/43725 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 2152. Compared 495368 event pairs, 12606 based on Foata normal form. 0/34239 useless extension candidates. Maximal degree in co-relation 24272. Up to 9045 conditions per place. [2025-03-04 10:07:50,838 INFO L140 encePairwiseOnDemand]: 109/120 looper letters, 191 selfloop transitions, 69 changer transitions 0/312 dead transitions. [2025-03-04 10:07:50,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 312 transitions, 1955 flow [2025-03-04 10:07:50,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:07:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:07:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1464 transitions. [2025-03-04 10:07:50,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2025-03-04 10:07:50,841 INFO L175 Difference]: Start difference. First operand has 154 places, 170 transitions, 860 flow. Second operand 21 states and 1464 transitions. [2025-03-04 10:07:50,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 312 transitions, 1955 flow [2025-03-04 10:07:50,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 312 transitions, 1942 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:50,848 INFO L231 Difference]: Finished difference. Result has 179 places, 209 transitions, 1381 flow [2025-03-04 10:07:50,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1381, PETRI_PLACES=179, PETRI_TRANSITIONS=209} [2025-03-04 10:07:50,848 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 65 predicate places. [2025-03-04 10:07:50,848 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 209 transitions, 1381 flow [2025-03-04 10:07:50,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 64.6842105263158) internal successors, (1229), 19 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:50,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:50,849 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:50,857 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-04 10:07:51,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:07:51,050 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:51,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:51,050 INFO L85 PathProgramCache]: Analyzing trace with hash 136986471, now seen corresponding path program 1 times [2025-03-04 10:07:51,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:51,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565385471] [2025-03-04 10:07:51,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:51,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:07:51,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:51,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:51,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:51,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565385471] [2025-03-04 10:07:51,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565385471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:51,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890367515] [2025-03-04 10:07:51,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:51,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:51,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:51,135 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:51,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:07:51,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:07:51,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:51,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:51,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:51,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:07:51,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:51,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:51,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890367515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:51,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:51,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:07:51,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807214416] [2025-03-04 10:07:51,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:51,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:51,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:51,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:51,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:51,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:51,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 209 transitions, 1381 flow. Second operand has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:51,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:51,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:51,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:58,202 INFO L124 PetriNetUnfolderBase]: 40096/87930 cut-off events. [2025-03-04 10:07:58,202 INFO L125 PetriNetUnfolderBase]: For 1026/1026 co-relation queries the response was YES. [2025-03-04 10:07:58,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143609 conditions, 87930 events. 40096/87930 cut-off events. For 1026/1026 co-relation queries the response was YES. Maximal size of possible extension queue 4153. Compared 1089435 event pairs, 25272 based on Foata normal form. 9/68571 useless extension candidates. Maximal degree in co-relation 143497. Up to 27126 conditions per place. [2025-03-04 10:07:58,921 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 162 selfloop transitions, 65 changer transitions 0/281 dead transitions. [2025-03-04 10:07:58,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 281 transitions, 2202 flow [2025-03-04 10:07:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:07:58,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:07:58,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2025-03-04 10:07:58,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-03-04 10:07:58,923 INFO L175 Difference]: Start difference. First operand has 179 places, 209 transitions, 1381 flow. Second operand 8 states and 642 transitions. [2025-03-04 10:07:58,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 281 transitions, 2202 flow [2025-03-04 10:07:58,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 281 transitions, 2012 flow, removed 36 selfloop flow, removed 10 redundant places. [2025-03-04 10:07:58,933 INFO L231 Difference]: Finished difference. Result has 179 places, 217 transitions, 1491 flow [2025-03-04 10:07:58,934 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1264, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1491, PETRI_PLACES=179, PETRI_TRANSITIONS=217} [2025-03-04 10:07:58,934 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 65 predicate places. [2025-03-04 10:07:58,934 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 217 transitions, 1491 flow [2025-03-04 10:07:58,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 70.42857142857143) internal successors, (986), 14 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:58,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:58,935 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:58,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:07:59,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:59,139 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:07:59,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:59,139 INFO L85 PathProgramCache]: Analyzing trace with hash 137130916, now seen corresponding path program 1 times [2025-03-04 10:07:59,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:59,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748548923] [2025-03-04 10:07:59,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:59,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:59,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:07:59,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:07:59,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:59,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:07:59,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748548923] [2025-03-04 10:07:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748548923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:59,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:07:59,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672494156] [2025-03-04 10:07:59,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:59,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:59,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:59,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:59,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:59,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 120 [2025-03-04 10:07:59,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 217 transitions, 1491 flow. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:59,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:59,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 120 [2025-03-04 10:07:59,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:06,441 INFO L124 PetriNetUnfolderBase]: 40690/89784 cut-off events. [2025-03-04 10:08:06,441 INFO L125 PetriNetUnfolderBase]: For 985/985 co-relation queries the response was YES. [2025-03-04 10:08:06,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146214 conditions, 89784 events. 40690/89784 cut-off events. For 985/985 co-relation queries the response was YES. Maximal size of possible extension queue 4175. Compared 1119479 event pairs, 25452 based on Foata normal form. 18/69174 useless extension candidates. Maximal degree in co-relation 146113. Up to 54369 conditions per place. [2025-03-04 10:08:07,223 INFO L140 encePairwiseOnDemand]: 116/120 looper letters, 149 selfloop transitions, 13 changer transitions 0/216 dead transitions. [2025-03-04 10:08:07,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 216 transitions, 1805 flow [2025-03-04 10:08:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:08:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:08:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 325 transitions. [2025-03-04 10:08:07,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2025-03-04 10:08:07,224 INFO L175 Difference]: Start difference. First operand has 179 places, 217 transitions, 1491 flow. Second operand 4 states and 325 transitions. [2025-03-04 10:08:07,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 216 transitions, 1805 flow [2025-03-04 10:08:07,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 216 transitions, 1728 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 10:08:07,238 INFO L231 Difference]: Finished difference. Result has 180 places, 215 transitions, 1426 flow [2025-03-04 10:08:07,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1426, PETRI_PLACES=180, PETRI_TRANSITIONS=215} [2025-03-04 10:08:07,239 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 66 predicate places. [2025-03-04 10:08:07,239 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 215 transitions, 1426 flow [2025-03-04 10:08:07,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 4 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:07,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:08:07,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:08:07,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 10:08:07,240 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 86 more)] === [2025-03-04 10:08:07,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:08:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1499805378, now seen corresponding path program 1 times [2025-03-04 10:08:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:08:07,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148522988] [2025-03-04 10:08:07,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:07,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:08:07,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:08:07,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:07,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:07,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:08:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148522988] [2025-03-04 10:08:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148522988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:08:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597302377] [2025-03-04 10:08:07,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:08:07,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:08:07,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:08:07,833 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:08:07,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:08:07,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:08:07,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:08:07,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:08:07,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:08:07,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 10:08:07,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:08:07,984 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-04 10:08:08,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:08,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:08:08,079 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 10:08:08,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 10:08:08,173 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 10:08:08,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-04 10:08:08,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 10:08:08,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:08,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:08,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-04 10:08:08,490 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-04 10:08:08,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-04 10:08:08,689 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 10:08:08,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-04 10:08:08,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-04 10:08:08,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:08,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:08:08,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2025-03-04 10:08:08,823 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-03-04 10:08:08,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-03-04 10:08:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:08,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:08:09,575 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 4738 treesize of output 4704 [2025-03-04 10:08:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:08:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597302377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:08:10,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:08:10,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2025-03-04 10:08:10,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991656297] [2025-03-04 10:08:10,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:08:10,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:08:10,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:08:10,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:08:10,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:08:13,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 120 [2025-03-04 10:08:13,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 215 transitions, 1426 flow. Second operand has 23 states, 23 states have (on average 57.73913043478261) internal successors, (1328), 23 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:08:13,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:08:13,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 120 [2025-03-04 10:08:13,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:08:18,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 10:08:27,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-03-04 10:08:31,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]