./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-subst.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-chromosome-subst.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 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:06:22,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:06:22,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:06:22,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:06:22,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:06:22,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:06:22,276 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:06:22,276 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:06:22,276 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:06:22,276 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:06:22,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:06:22,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:06:22,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:06:22,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:06:22,278 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:06:22,279 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:06:22,279 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:06:22,279 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:06:22,279 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:06:22,279 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:06:22,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:06:22,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:06:22,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:22,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:06:22,280 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:06:22,280 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 -> 60539e5483ee028af31550fcc6bdc40a30b35263f2407e34b5392a698998aa9c [2025-03-04 10:06:22,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:06:22,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:06:22,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:06:22,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:06:22,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:06:22,467 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 10:06:23,626 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149d380b9/8f00be16dfc94a69ba805cb743d6e386/FLAG749572453 [2025-03-04 10:06:23,843 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:06:23,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-subst.wvr.c [2025-03-04 10:06:23,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149d380b9/8f00be16dfc94a69ba805cb743d6e386/FLAG749572453 [2025-03-04 10:06:24,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149d380b9/8f00be16dfc94a69ba805cb743d6e386 [2025-03-04 10:06:24,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:06:24,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:06:24,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:24,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:06:24,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:06:24,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b6642a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24, skipping insertion in model container [2025-03-04 10:06:24,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:06:24,312 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:06:24,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:24,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:06:24,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:24,352 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:06:24,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24 WrapperNode [2025-03-04 10:06:24,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:24,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:24,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:06:24,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:06:24,358 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:06:24" (1/1) ... [2025-03-04 10:06:24,366 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:06:24" (1/1) ... [2025-03-04 10:06:24,390 INFO L138 Inliner]: procedures = 25, calls = 33, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 255 [2025-03-04 10:06:24,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:24,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:06:24,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:06:24,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:06:24,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,427 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-04 10:06:24,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,445 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:06:24,451 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:06:24,452 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:06:24,452 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:06:24,452 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (1/1) ... [2025-03-04 10:06:24,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:24,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:24,476 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:06:24,481 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:06:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:06:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:06:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:06:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:06:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:06:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:06:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:06:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:06:24,497 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:06:24,581 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:06:24,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:06:24,963 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:06:24,963 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:06:25,183 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:06:25,183 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:06:25,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:25 BoogieIcfgContainer [2025-03-04 10:06:25,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:06:25,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:06:25,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:06:25,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:06:25,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:06:24" (1/3) ... [2025-03-04 10:06:25,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e370535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:25, skipping insertion in model container [2025-03-04 10:06:25,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:24" (2/3) ... [2025-03-04 10:06:25,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e370535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:25, skipping insertion in model container [2025-03-04 10:06:25,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:25" (3/3) ... [2025-03-04 10:06:25,191 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-subst.wvr.c [2025-03-04 10:06:25,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:06:25,204 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-subst.wvr.c that has 4 procedures, 55 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-03-04 10:06:25,204 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:06:25,274 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:06:25,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 141 flow [2025-03-04 10:06:25,323 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-03-04 10:06:25,325 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:25,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 6/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 133 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-04 10:06:25,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 60 transitions, 141 flow [2025-03-04 10:06:25,332 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 130 flow [2025-03-04 10:06:25,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:06:25,351 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;@6196fe64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:06:25,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-04 10:06:25,355 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:06:25,356 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:06:25,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:06:25,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:25,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:25,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:25,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 780165, now seen corresponding path program 1 times [2025-03-04 10:06:25,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:25,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290088852] [2025-03-04 10:06:25,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:25,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:25,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:25,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:25,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:25,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:25,545 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:06:25,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290088852] [2025-03-04 10:06:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290088852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:25,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:25,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:06:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384078326] [2025-03-04 10:06:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:25,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:06:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:25,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:06:25,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:06:25,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:25,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:06:25,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:25,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:25,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:25,726 INFO L124 PetriNetUnfolderBase]: 202/389 cut-off events. [2025-03-04 10:06:25,726 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 10:06:25,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 389 events. 202/389 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1511 event pairs, 124 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 618. Up to 293 conditions per place. [2025-03-04 10:06:25,733 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-03-04 10:06:25,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 178 flow [2025-03-04 10:06:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-04 10:06:25,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-04 10:06:25,743 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 130 flow. Second operand 3 states and 111 transitions. [2025-03-04 10:06:25,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 178 flow [2025-03-04 10:06:25,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:25,747 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 112 flow [2025-03-04 10:06:25,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2025-03-04 10:06:25,752 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-03-04 10:06:25,752 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 112 flow [2025-03-04 10:06:25,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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:06:25,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:25,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:25,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:06:25,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:25,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 780166, now seen corresponding path program 1 times [2025-03-04 10:06:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:25,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954110895] [2025-03-04 10:06:25,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:25,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:25,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:25,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:25,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:25,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:25,931 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:06:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:25,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954110895] [2025-03-04 10:06:25,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954110895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:25,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:25,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:25,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361202303] [2025-03-04 10:06:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:25,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:25,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:25,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:25,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:25,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:06:25,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:25,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:25,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:26,107 INFO L124 PetriNetUnfolderBase]: 202/395 cut-off events. [2025-03-04 10:06:26,108 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:26,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 395 events. 202/395 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1503 event pairs, 124 based on Foata normal form. 1/328 useless extension candidates. Maximal degree in co-relation 680. Up to 305 conditions per place. [2025-03-04 10:06:26,110 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 32 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2025-03-04 10:06:26,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 200 flow [2025-03-04 10:06:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-04 10:06:26,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-03-04 10:06:26,112 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 112 flow. Second operand 3 states and 122 transitions. [2025-03-04 10:06:26,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 200 flow [2025-03-04 10:06:26,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:26,114 INFO L231 Difference]: Finished difference. Result has 52 places, 54 transitions, 146 flow [2025-03-04 10:06:26,114 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=52, PETRI_TRANSITIONS=54} [2025-03-04 10:06:26,114 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2025-03-04 10:06:26,115 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 54 transitions, 146 flow [2025-03-04 10:06:26,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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:06:26,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:26,115 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:06:26,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:06:26,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:26,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:26,115 INFO L85 PathProgramCache]: Analyzing trace with hash 749763385, now seen corresponding path program 1 times [2025-03-04 10:06:26,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446315126] [2025-03-04 10:06:26,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:26,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:26,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:26,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,326 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:06:26,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446315126] [2025-03-04 10:06:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446315126] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790900279] [2025-03-04 10:06:26,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:26,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:26,329 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:06:26,330 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:06:26,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:26,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:26,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:06:26,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:26,421 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:06:26,467 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:06:26,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:26,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790900279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:26,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:26,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-04 10:06:26,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119004414] [2025-03-04 10:06:26,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:26,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:06:26,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:26,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:06:26,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:06:26,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:26,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 54 transitions, 146 flow. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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:06:26,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:26,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:26,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:26,954 INFO L124 PetriNetUnfolderBase]: 208/419 cut-off events. [2025-03-04 10:06:26,954 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:26,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 419 events. 208/419 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1560 event pairs, 124 based on Foata normal form. 3/356 useless extension candidates. Maximal degree in co-relation 712. Up to 307 conditions per place. [2025-03-04 10:06:26,959 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 41 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2025-03-04 10:06:26,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 358 flow [2025-03-04 10:06:26,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:26,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2025-03-04 10:06:26,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-04 10:06:26,963 INFO L175 Difference]: Start difference. First operand has 52 places, 54 transitions, 146 flow. Second operand 6 states and 230 transitions. [2025-03-04 10:06:26,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 358 flow [2025-03-04 10:06:26,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:26,965 INFO L231 Difference]: Finished difference. Result has 59 places, 69 transitions, 292 flow [2025-03-04 10:06:26,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=59, PETRI_TRANSITIONS=69} [2025-03-04 10:06:26,967 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2025-03-04 10:06:26,967 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 69 transitions, 292 flow [2025-03-04 10:06:26,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 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:06:26,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:26,968 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-04 10:06:26,974 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:06:27,168 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:06:27,169 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:27,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:27,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1898066386, now seen corresponding path program 2 times [2025-03-04 10:06:27,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:27,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951722440] [2025-03-04 10:06:27,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:27,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:06:27,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:27,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:27,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:27,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:27,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951722440] [2025-03-04 10:06:27,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951722440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:27,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150174951] [2025-03-04 10:06:27,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:27,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:27,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:27,383 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:06:27,385 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:06:27,429 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-04 10:06:27,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:27,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:27,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:27,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:06:27,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:27,455 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:06:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:27,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150174951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:27,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:27,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-04 10:06:27,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049985922] [2025-03-04 10:06:27,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:27,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:06:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:27,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:06:27,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:06:28,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:06:28,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 69 transitions, 292 flow. Second operand has 19 states, 19 states have (on average 27.68421052631579) internal successors, (526), 19 states have internal predecessors, (526), 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:06:28,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:28,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:06:28,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:28,459 INFO L124 PetriNetUnfolderBase]: 208/416 cut-off events. [2025-03-04 10:06:28,460 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 10:06:28,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 416 events. 208/416 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1551 event pairs, 124 based on Foata normal form. 3/356 useless extension candidates. Maximal degree in co-relation 744. Up to 295 conditions per place. [2025-03-04 10:06:28,462 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 22 selfloop transitions, 37 changer transitions 0/78 dead transitions. [2025-03-04 10:06:28,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 404 flow [2025-03-04 10:06:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:06:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:06:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 348 transitions. [2025-03-04 10:06:28,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-04 10:06:28,467 INFO L175 Difference]: Start difference. First operand has 59 places, 69 transitions, 292 flow. Second operand 11 states and 348 transitions. [2025-03-04 10:06:28,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 404 flow [2025-03-04 10:06:28,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 330 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:28,470 INFO L231 Difference]: Finished difference. Result has 61 places, 78 transitions, 292 flow [2025-03-04 10:06:28,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=292, PETRI_PLACES=61, PETRI_TRANSITIONS=78} [2025-03-04 10:06:28,470 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2025-03-04 10:06:28,471 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 78 transitions, 292 flow [2025-03-04 10:06:28,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 27.68421052631579) internal successors, (526), 19 states have internal predecessors, (526), 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:06:28,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:28,472 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:28,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:28,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:06:28,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:28,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1413072292, now seen corresponding path program 1 times [2025-03-04 10:06:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-03-04 10:06:28,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:28,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:28,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:28,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:28,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:06:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-03-04 10:06:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349513331] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599219283] [2025-03-04 10:06:28,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:28,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:28,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:28,792 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:06:28,794 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:06:28,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:28,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:28,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:28,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:28,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:06:28,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:06:28,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:06:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599219283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:28,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:28,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-03-04 10:06:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89210453] [2025-03-04 10:06:28,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:28,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:28,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:28,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:28,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:28,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-04 10:06:28,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 78 transitions, 292 flow. Second operand has 11 states, 11 states have (on average 31.90909090909091) internal successors, (351), 11 states have internal predecessors, (351), 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:06:28,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:28,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-04 10:06:28,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:29,092 INFO L124 PetriNetUnfolderBase]: 202/413 cut-off events. [2025-03-04 10:06:29,092 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:29,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 413 events. 202/413 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1506 event pairs, 124 based on Foata normal form. 9/359 useless extension candidates. Maximal degree in co-relation 680. Up to 296 conditions per place. [2025-03-04 10:06:29,094 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 35 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2025-03-04 10:06:29,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 380 flow [2025-03-04 10:06:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-03-04 10:06:29,096 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-03-04 10:06:29,096 INFO L175 Difference]: Start difference. First operand has 61 places, 78 transitions, 292 flow. Second operand 7 states and 268 transitions. [2025-03-04 10:06:29,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 380 flow [2025-03-04 10:06:29,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 340 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:29,100 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 296 flow [2025-03-04 10:06:29,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2025-03-04 10:06:29,101 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-03-04 10:06:29,102 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 296 flow [2025-03-04 10:06:29,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.90909090909091) internal successors, (351), 11 states have internal predecessors, (351), 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:06:29,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:29,103 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:29,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:06:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:29,303 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:29,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:29,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2036603401, now seen corresponding path program 2 times [2025-03-04 10:06:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859910493] [2025-03-04 10:06:29,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:29,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:06:29,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-03-04 10:06:29,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:06:29,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:06:29,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859910493] [2025-03-04 10:06:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859910493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672154802] [2025-03-04 10:06:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:29,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:29,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:29,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:29,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:29,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-04 10:06:29,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 296 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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:06:29,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:29,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-04 10:06:29,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:29,586 INFO L124 PetriNetUnfolderBase]: 343/651 cut-off events. [2025-03-04 10:06:29,586 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:06:29,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 651 events. 343/651 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2889 event pairs, 234 based on Foata normal form. 0/572 useless extension candidates. Maximal degree in co-relation 1131. Up to 494 conditions per place. [2025-03-04 10:06:29,591 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 55 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-03-04 10:06:29,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 408 flow [2025-03-04 10:06:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-03-04 10:06:29,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2025-03-04 10:06:29,593 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 296 flow. Second operand 5 states and 143 transitions. [2025-03-04 10:06:29,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 408 flow [2025-03-04 10:06:29,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 375 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:29,597 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 265 flow [2025-03-04 10:06:29,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=265, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2025-03-04 10:06:29,598 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-03-04 10:06:29,599 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 265 flow [2025-03-04 10:06:29,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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:06:29,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:29,600 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:29,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:06:29,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:29,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2036603402, now seen corresponding path program 1 times [2025-03-04 10:06:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553237934] [2025-03-04 10:06:29,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:29,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:29,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:06:29,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:06:29,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:29,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:06:30,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:30,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553237934] [2025-03-04 10:06:30,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553237934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:30,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143801541] [2025-03-04 10:06:30,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:30,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:30,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:30,419 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:06:30,420 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:06:30,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:06:30,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:06:30,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:30,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:30,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 10:06:30,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:30,516 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:06:30,520 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:06:30,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:30,587 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:06:30,597 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:30,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:30,633 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:30,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:30,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:31,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143801541] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:31,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:31,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12, 9] total 28 [2025-03-04 10:06:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938807638] [2025-03-04 10:06:31,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:31,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:31,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:31,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:31,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:06:31,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 10:06:31,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 265 flow. Second operand has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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:06:31,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:31,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 10:06:31,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:31,882 INFO L124 PetriNetUnfolderBase]: 459/854 cut-off events. [2025-03-04 10:06:31,882 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:06:31,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 854 events. 459/854 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3908 event pairs, 169 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1516. Up to 351 conditions per place. [2025-03-04 10:06:31,886 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 69 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2025-03-04 10:06:31,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 90 transitions, 454 flow [2025-03-04 10:06:31,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2025-03-04 10:06:31,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5861111111111111 [2025-03-04 10:06:31,887 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 265 flow. Second operand 6 states and 211 transitions. [2025-03-04 10:06:31,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 90 transitions, 454 flow [2025-03-04 10:06:31,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 90 transitions, 449 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:31,889 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 285 flow [2025-03-04 10:06:31,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2025-03-04 10:06:31,890 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 4 predicate places. [2025-03-04 10:06:31,890 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 74 transitions, 285 flow [2025-03-04 10:06:31,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.90909090909091) internal successors, (318), 11 states have internal predecessors, (318), 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:06:31,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:31,890 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:31,896 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:06:32,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:32,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:32,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:32,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1289803269, now seen corresponding path program 1 times [2025-03-04 10:06:32,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:32,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330626886] [2025-03-04 10:06:32,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:32,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:32,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:06:32,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:32,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:32,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 10:06:32,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:32,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330626886] [2025-03-04 10:06:32,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330626886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:32,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:32,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:32,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777376990] [2025-03-04 10:06:32,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:32,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:32,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:32,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:32,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-03-04 10:06:32,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 74 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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:06:32,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:32,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-03-04 10:06:32,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:32,356 INFO L124 PetriNetUnfolderBase]: 399/721 cut-off events. [2025-03-04 10:06:32,357 INFO L125 PetriNetUnfolderBase]: For 221/250 co-relation queries the response was YES. [2025-03-04 10:06:32,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 721 events. 399/721 cut-off events. For 221/250 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3055 event pairs, 299 based on Foata normal form. 30/699 useless extension candidates. Maximal degree in co-relation 1433. Up to 592 conditions per place. [2025-03-04 10:06:32,360 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-03-04 10:06:32,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 395 flow [2025-03-04 10:06:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-03-04 10:06:32,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-04 10:06:32,361 INFO L175 Difference]: Start difference. First operand has 64 places, 74 transitions, 285 flow. Second operand 5 states and 147 transitions. [2025-03-04 10:06:32,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 395 flow [2025-03-04 10:06:32,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 387 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:32,362 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 279 flow [2025-03-04 10:06:32,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2025-03-04 10:06:32,363 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-04 10:06:32,363 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 279 flow [2025-03-04 10:06:32,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 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:06:32,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:32,363 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:32,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:06:32,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:32,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1289803268, now seen corresponding path program 1 times [2025-03-04 10:06:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732055419] [2025-03-04 10:06:32,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:32,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:06:32,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:32,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:32,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 10:06:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732055419] [2025-03-04 10:06:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732055419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522548857] [2025-03-04 10:06:32,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:32,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:32,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:32,691 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:06:32,698 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:06:32,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:06:32,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:06:32,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:32,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:32,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 10:06:32,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:32,823 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:06:32,825 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:06:32,901 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:32,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:32,913 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:32,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:33,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:33,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522548857] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:33,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:33,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6, 9] total 22 [2025-03-04 10:06:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129922637] [2025-03-04 10:06:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:33,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:06:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:33,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:06:33,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:06:33,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:33,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 279 flow. Second operand has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 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:06:33,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:33,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:33,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:33,861 INFO L124 PetriNetUnfolderBase]: 400/750 cut-off events. [2025-03-04 10:06:33,861 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-03-04 10:06:33,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 750 events. 400/750 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3269 event pairs, 169 based on Foata normal form. 26/711 useless extension candidates. Maximal degree in co-relation 1483. Up to 377 conditions per place. [2025-03-04 10:06:33,865 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 69 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-04 10:06:33,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 469 flow [2025-03-04 10:06:33,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-03-04 10:06:33,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-04 10:06:33,866 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 279 flow. Second operand 6 states and 216 transitions. [2025-03-04 10:06:33,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 469 flow [2025-03-04 10:06:33,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 464 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:33,867 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 295 flow [2025-03-04 10:06:33,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2025-03-04 10:06:33,868 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-04 10:06:33,868 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 295 flow [2025-03-04 10:06:33,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 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:06:33,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:33,868 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:33,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:06:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:34,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1364401968, now seen corresponding path program 1 times [2025-03-04 10:06:34,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:34,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968782992] [2025-03-04 10:06:34,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:34,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:06:34,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:06:34,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:34,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 13 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:06:34,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968782992] [2025-03-04 10:06:34,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968782992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:34,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750019095] [2025-03-04 10:06:34,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:34,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:34,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:34,745 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:06:34,745 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:06:34,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:06:34,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:06:34,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:34,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 10:06:34,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:34,857 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:06:34,859 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:06:34,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:34,911 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:06:34,917 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:34,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:34,956 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:34,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:35,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750019095] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:35,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:35,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 28 [2025-03-04 10:06:35,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870951165] [2025-03-04 10:06:35,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:35,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:35,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:35,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:35,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:06:35,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 10:06:35,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 295 flow. Second operand has 11 states, 11 states have (on average 29.09090909090909) internal successors, (320), 11 states have internal predecessors, (320), 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:06:35,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:35,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 10:06:35,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:36,072 INFO L124 PetriNetUnfolderBase]: 775/1395 cut-off events. [2025-03-04 10:06:36,072 INFO L125 PetriNetUnfolderBase]: For 990/1093 co-relation queries the response was YES. [2025-03-04 10:06:36,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3193 conditions, 1395 events. 775/1395 cut-off events. For 990/1093 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7361 event pairs, 315 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 3060. Up to 604 conditions per place. [2025-03-04 10:06:36,078 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 69 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-04 10:06:36,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 498 flow [2025-03-04 10:06:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:36,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2025-03-04 10:06:36,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2025-03-04 10:06:36,080 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 295 flow. Second operand 6 states and 209 transitions. [2025-03-04 10:06:36,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 498 flow [2025-03-04 10:06:36,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 488 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:36,082 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 312 flow [2025-03-04 10:06:36,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2025-03-04 10:06:36,083 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-03-04 10:06:36,083 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 312 flow [2025-03-04 10:06:36,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 29.09090909090909) internal successors, (320), 11 states have internal predecessors, (320), 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:06:36,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:36,084 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:36,090 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:06:36,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:36,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:36,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:36,285 INFO L85 PathProgramCache]: Analyzing trace with hash 653212670, now seen corresponding path program 1 times [2025-03-04 10:06:36,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:36,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-03-04 10:06:36,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:36,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:36,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:36,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:36,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:36,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-04 10:06:36,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:36,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93646670] [2025-03-04 10:06:36,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93646670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:36,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:36,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360825859] [2025-03-04 10:06:36,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:36,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:36,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:36,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:36,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:36,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 10:06:36,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:06:36,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:36,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 10:06:36,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:36,486 INFO L124 PetriNetUnfolderBase]: 525/985 cut-off events. [2025-03-04 10:06:36,487 INFO L125 PetriNetUnfolderBase]: For 763/855 co-relation queries the response was YES. [2025-03-04 10:06:36,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 985 events. 525/985 cut-off events. For 763/855 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4807 event pairs, 406 based on Foata normal form. 31/935 useless extension candidates. Maximal degree in co-relation 2326. Up to 773 conditions per place. [2025-03-04 10:06:36,491 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-04 10:06:36,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 422 flow [2025-03-04 10:06:36,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-04 10:06:36,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2025-03-04 10:06:36,494 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 312 flow. Second operand 4 states and 127 transitions. [2025-03-04 10:06:36,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 422 flow [2025-03-04 10:06:36,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 414 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:36,495 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 304 flow [2025-03-04 10:06:36,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2025-03-04 10:06:36,497 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-04 10:06:36,497 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 304 flow [2025-03-04 10:06:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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:06:36,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:36,498 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:36,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:06:36,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:36,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash 653212671, now seen corresponding path program 1 times [2025-03-04 10:06:36,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352626455] [2025-03-04 10:06:36,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:36,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:36,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:36,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:36,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:36,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:36,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:36,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352626455] [2025-03-04 10:06:36,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352626455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:36,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259236675] [2025-03-04 10:06:36,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:36,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:36,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:36,771 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:06:36,773 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:06:36,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:36,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:36,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:36,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:36,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 10:06:36,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:36,875 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:06:36,961 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:36,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:37,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:06:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259236675] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:37,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 10] total 19 [2025-03-04 10:06:37,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095018031] [2025-03-04 10:06:37,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:37,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:37,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:37,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:37,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:06:37,166 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:37,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:37,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:37,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:37,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:37,317 INFO L124 PetriNetUnfolderBase]: 668/1206 cut-off events. [2025-03-04 10:06:37,318 INFO L125 PetriNetUnfolderBase]: For 814/901 co-relation queries the response was YES. [2025-03-04 10:06:37,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 1206 events. 668/1206 cut-off events. For 814/901 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6072 event pairs, 315 based on Foata normal form. 46/1162 useless extension candidates. Maximal degree in co-relation 2888. Up to 650 conditions per place. [2025-03-04 10:06:37,323 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 70 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-03-04 10:06:37,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 88 transitions, 506 flow [2025-03-04 10:06:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 186 transitions. [2025-03-04 10:06:37,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.62 [2025-03-04 10:06:37,325 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 304 flow. Second operand 5 states and 186 transitions. [2025-03-04 10:06:37,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 88 transitions, 506 flow [2025-03-04 10:06:37,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 88 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:37,328 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 320 flow [2025-03-04 10:06:37,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=68, PETRI_TRANSITIONS=73} [2025-03-04 10:06:37,329 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-03-04 10:06:37,329 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 320 flow [2025-03-04 10:06:37,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:37,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:37,330 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:37,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:06:37,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:37,530 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:37,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:37,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1744633473, now seen corresponding path program 1 times [2025-03-04 10:06:37,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:37,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801878175] [2025-03-04 10:06:37,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:37,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:37,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-04 10:06:37,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801878175] [2025-03-04 10:06:37,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801878175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:37,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528191640] [2025-03-04 10:06:37,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:37,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:37,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:37,985 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:06:37,987 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:06:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 10:06:38,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 10:06:38,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:38,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:38,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 10:06:38,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:38,089 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:06:38,093 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:06:38,150 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:38,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:38,154 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:06:38,327 INFO L349 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2025-03-04 10:06:38,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2025-03-04 10:06:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:38,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:38,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528191640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:38,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:38,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2025-03-04 10:06:38,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068610967] [2025-03-04 10:06:38,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:38,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:06:38,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:38,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:06:38,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2025-03-04 10:06:40,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 10:06:40,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 320 flow. Second operand has 31 states, 31 states have (on average 26.096774193548388) internal successors, (809), 31 states have internal predecessors, (809), 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:06:40,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:40,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 10:06:40,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:41,029 INFO L124 PetriNetUnfolderBase]: 1736/3035 cut-off events. [2025-03-04 10:06:41,030 INFO L125 PetriNetUnfolderBase]: For 3287/3492 co-relation queries the response was YES. [2025-03-04 10:06:41,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8100 conditions, 3035 events. 1736/3035 cut-off events. For 3287/3492 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 17038 event pairs, 285 based on Foata normal form. 126/3088 useless extension candidates. Maximal degree in co-relation 7965. Up to 577 conditions per place. [2025-03-04 10:06:41,043 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 120 selfloop transitions, 14 changer transitions 0/146 dead transitions. [2025-03-04 10:06:41,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 146 transitions, 841 flow [2025-03-04 10:06:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:06:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:06:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 449 transitions. [2025-03-04 10:06:41,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5345238095238095 [2025-03-04 10:06:41,045 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 320 flow. Second operand 14 states and 449 transitions. [2025-03-04 10:06:41,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 146 transitions, 841 flow [2025-03-04 10:06:41,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 146 transitions, 827 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:41,048 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 380 flow [2025-03-04 10:06:41,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=380, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2025-03-04 10:06:41,048 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2025-03-04 10:06:41,048 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 380 flow [2025-03-04 10:06:41,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 26.096774193548388) internal successors, (809), 31 states have internal predecessors, (809), 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:06:41,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:41,049 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:41,055 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:06:41,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:06:41,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1267987117, now seen corresponding path program 1 times [2025-03-04 10:06:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:41,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392177643] [2025-03-04 10:06:41,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:41,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:41,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:06:41,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:06:41,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:41,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 10:06:41,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392177643] [2025-03-04 10:06:41,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392177643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:41,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850274893] [2025-03-04 10:06:41,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:41,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:41,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:41,468 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:06:41,470 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:06:41,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:06:41,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:06:41,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:41,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:41,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:06:41,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:41,582 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:06:41,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:41,680 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 16 treesize of output 11 [2025-03-04 10:06:41,684 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:41,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:41,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:41,863 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 52 treesize of output 48 [2025-03-04 10:06:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850274893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:42,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:42,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 22 [2025-03-04 10:06:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395287841] [2025-03-04 10:06:42,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:42,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:06:42,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:42,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:06:42,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:06:42,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 10:06:42,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 380 flow. Second operand has 23 states, 23 states have (on average 26.782608695652176) internal successors, (616), 23 states have internal predecessors, (616), 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:06:42,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:42,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 10:06:42,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:43,782 INFO L124 PetriNetUnfolderBase]: 3486/5985 cut-off events. [2025-03-04 10:06:43,782 INFO L125 PetriNetUnfolderBase]: For 10265/11342 co-relation queries the response was YES. [2025-03-04 10:06:43,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16326 conditions, 5985 events. 3486/5985 cut-off events. For 10265/11342 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 39444 event pairs, 1256 based on Foata normal form. 0/5729 useless extension candidates. Maximal degree in co-relation 16181. Up to 2119 conditions per place. [2025-03-04 10:06:43,811 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 77 selfloop transitions, 20 changer transitions 0/111 dead transitions. [2025-03-04 10:06:43,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 111 transitions, 766 flow [2025-03-04 10:06:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:06:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:06:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 444 transitions. [2025-03-04 10:06:43,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2025-03-04 10:06:43,816 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 380 flow. Second operand 15 states and 444 transitions. [2025-03-04 10:06:43,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 111 transitions, 766 flow [2025-03-04 10:06:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 755 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:43,820 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 432 flow [2025-03-04 10:06:43,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=432, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2025-03-04 10:06:43,820 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 35 predicate places. [2025-03-04 10:06:43,820 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 432 flow [2025-03-04 10:06:43,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 26.782608695652176) internal successors, (616), 23 states have internal predecessors, (616), 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:06:43,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:43,821 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:43,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:06:44,021 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,SelfDestructingSolverStorable13 [2025-03-04 10:06:44,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:44,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:44,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1750936475, now seen corresponding path program 1 times [2025-03-04 10:06:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:44,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044104316] [2025-03-04 10:06:44,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:44,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:06:44,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:06:44,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:44,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 10:06:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044104316] [2025-03-04 10:06:44,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044104316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:44,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174092705] [2025-03-04 10:06:44,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:44,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:44,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:44,290 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:06:44,292 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:06:44,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:06:44,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:06:44,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:44,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:44,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:06:44,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:44,402 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:06:44,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:44,504 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 16 treesize of output 11 [2025-03-04 10:06:44,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:44,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:06:44,589 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:44,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:44,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:06:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174092705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:44,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:44,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2025-03-04 10:06:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900873588] [2025-03-04 10:06:44,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 10:06:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:44,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 10:06:44,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-03-04 10:06:45,776 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-04 10:06:45,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 432 flow. Second operand has 26 states, 26 states have (on average 27.115384615384617) internal successors, (705), 26 states have internal predecessors, (705), 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:06:45,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:45,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-04 10:06:45,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:46,574 INFO L124 PetriNetUnfolderBase]: 2663/4954 cut-off events. [2025-03-04 10:06:46,574 INFO L125 PetriNetUnfolderBase]: For 8421/8913 co-relation queries the response was YES. [2025-03-04 10:06:46,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14914 conditions, 4954 events. 2663/4954 cut-off events. For 8421/8913 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 33782 event pairs, 673 based on Foata normal form. 246/5124 useless extension candidates. Maximal degree in co-relation 14753. Up to 1216 conditions per place. [2025-03-04 10:06:46,631 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 114 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2025-03-04 10:06:46,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 151 transitions, 985 flow [2025-03-04 10:06:46,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:06:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:06:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 550 transitions. [2025-03-04 10:06:46,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-03-04 10:06:46,634 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 432 flow. Second operand 17 states and 550 transitions. [2025-03-04 10:06:46,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 151 transitions, 985 flow [2025-03-04 10:06:46,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 151 transitions, 980 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:46,644 INFO L231 Difference]: Finished difference. Result has 113 places, 79 transitions, 494 flow [2025-03-04 10:06:46,644 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=494, PETRI_PLACES=113, PETRI_TRANSITIONS=79} [2025-03-04 10:06:46,644 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 53 predicate places. [2025-03-04 10:06:46,644 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 79 transitions, 494 flow [2025-03-04 10:06:46,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 27.115384615384617) internal successors, (705), 26 states have internal predecessors, (705), 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:06:46,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:46,645 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:46,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:46,845 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,SelfDestructingSolverStorable14 [2025-03-04 10:06:46,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:46,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:46,846 INFO L85 PathProgramCache]: Analyzing trace with hash -652894235, now seen corresponding path program 1 times [2025-03-04 10:06:46,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:46,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315274556] [2025-03-04 10:06:46,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:46,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:06:46,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:06:46,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:46,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:47,119 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:47,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:47,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315274556] [2025-03-04 10:06:47,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315274556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:47,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304495143] [2025-03-04 10:06:47,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:47,121 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:06:47,134 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:06:47,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:06:47,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:06:47,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:47,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:47,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 10:06:47,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:47,251 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:06:47,356 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:47,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:47,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:06:47,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304495143] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:47,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:47,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9, 10] total 18 [2025-03-04 10:06:47,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324287359] [2025-03-04 10:06:47,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:47,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:47,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:47,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:47,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:06:47,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:47,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 79 transitions, 494 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:06:47,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:47,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:47,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:48,176 INFO L124 PetriNetUnfolderBase]: 2891/5181 cut-off events. [2025-03-04 10:06:48,176 INFO L125 PetriNetUnfolderBase]: For 13607/14395 co-relation queries the response was YES. [2025-03-04 10:06:48,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16234 conditions, 5181 events. 2891/5181 cut-off events. For 13607/14395 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 34549 event pairs, 1852 based on Foata normal form. 145/5222 useless extension candidates. Maximal degree in co-relation 16055. Up to 3151 conditions per place. [2025-03-04 10:06:48,202 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 76 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2025-03-04 10:06:48,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 96 transitions, 770 flow [2025-03-04 10:06:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-03-04 10:06:48,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-03-04 10:06:48,203 INFO L175 Difference]: Start difference. First operand has 113 places, 79 transitions, 494 flow. Second operand 5 states and 184 transitions. [2025-03-04 10:06:48,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 96 transitions, 770 flow [2025-03-04 10:06:48,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 718 flow, removed 2 selfloop flow, removed 15 redundant places. [2025-03-04 10:06:48,215 INFO L231 Difference]: Finished difference. Result has 103 places, 79 transitions, 464 flow [2025-03-04 10:06:48,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=464, PETRI_PLACES=103, PETRI_TRANSITIONS=79} [2025-03-04 10:06:48,216 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 43 predicate places. [2025-03-04 10:06:48,216 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 79 transitions, 464 flow [2025-03-04 10:06:48,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:06:48,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:48,216 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:48,222 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:06:48,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:06:48,420 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:48,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:48,420 INFO L85 PathProgramCache]: Analyzing trace with hash 672177380, now seen corresponding path program 1 times [2025-03-04 10:06:48,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:48,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-03-04 10:06:48,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:48,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:48,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:06:48,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:06:48,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:48,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-04 10:06:48,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929348154] [2025-03-04 10:06:48,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929348154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:48,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138448010] [2025-03-04 10:06:48,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:48,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:48,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:48,815 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:06:48,816 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:06:48,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:06:48,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:06:48,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:48,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 10:06:48,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:48,930 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:06:48,971 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:06:48,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:06:49,118 INFO L349 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2025-03-04 10:06:49,118 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 3 case distinctions, treesize of input 17 treesize of output 22 [2025-03-04 10:06:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:49,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:49,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138448010] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:49,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 32 [2025-03-04 10:06:49,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006841344] [2025-03-04 10:06:49,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:49,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 10:06:49,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:49,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 10:06:49,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 10:06:50,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 10:06:50,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 79 transitions, 464 flow. Second operand has 34 states, 34 states have (on average 23.294117647058822) internal successors, (792), 34 states have internal predecessors, (792), 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:06:50,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:50,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 10:06:50,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:52,245 INFO L124 PetriNetUnfolderBase]: 7896/13977 cut-off events. [2025-03-04 10:06:52,246 INFO L125 PetriNetUnfolderBase]: For 33626/35199 co-relation queries the response was YES. [2025-03-04 10:06:52,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43341 conditions, 13977 events. 7896/13977 cut-off events. For 33626/35199 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 107426 event pairs, 1615 based on Foata normal form. 633/14455 useless extension candidates. Maximal degree in co-relation 43145. Up to 2748 conditions per place. [2025-03-04 10:06:52,324 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 125 selfloop transitions, 27 changer transitions 0/166 dead transitions. [2025-03-04 10:06:52,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 166 transitions, 1297 flow [2025-03-04 10:06:52,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 10:06:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 10:06:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 550 transitions. [2025-03-04 10:06:52,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-04 10:06:52,331 INFO L175 Difference]: Start difference. First operand has 103 places, 79 transitions, 464 flow. Second operand 20 states and 550 transitions. [2025-03-04 10:06:52,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 166 transitions, 1297 flow [2025-03-04 10:06:52,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 166 transitions, 1273 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:52,384 INFO L231 Difference]: Finished difference. Result has 123 places, 87 transitions, 595 flow [2025-03-04 10:06:52,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=595, PETRI_PLACES=123, PETRI_TRANSITIONS=87} [2025-03-04 10:06:52,385 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 63 predicate places. [2025-03-04 10:06:52,385 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 87 transitions, 595 flow [2025-03-04 10:06:52,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 23.294117647058822) internal successors, (792), 34 states have internal predecessors, (792), 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:06:52,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:52,385 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:52,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:06:52,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:06:52,586 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash -637336981, now seen corresponding path program 1 times [2025-03-04 10:06:52,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:52,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708910837] [2025-03-04 10:06:52,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:52,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:52,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:06:52,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:06:52,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:52,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 10:06:52,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708910837] [2025-03-04 10:06:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708910837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:52,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146803558] [2025-03-04 10:06:52,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:52,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:52,831 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:52,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:06:52,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:06:52,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:06:52,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:52,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:52,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:06:52,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:53,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:53,176 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 24 treesize of output 20 [2025-03-04 10:06:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146803558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:53,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:53,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 24 [2025-03-04 10:06:53,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845172643] [2025-03-04 10:06:53,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:53,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 10:06:53,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:53,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 10:06:53,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:06:53,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:53,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 87 transitions, 595 flow. Second operand has 25 states, 25 states have (on average 30.12) internal successors, (753), 25 states have internal predecessors, (753), 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:06:53,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:53,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:53,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:55,544 INFO L124 PetriNetUnfolderBase]: 5981/11295 cut-off events. [2025-03-04 10:06:55,545 INFO L125 PetriNetUnfolderBase]: For 30605/31858 co-relation queries the response was YES. [2025-03-04 10:06:55,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37144 conditions, 11295 events. 5981/11295 cut-off events. For 30605/31858 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 89358 event pairs, 1561 based on Foata normal form. 633/11697 useless extension candidates. Maximal degree in co-relation 36923. Up to 2959 conditions per place. [2025-03-04 10:06:55,637 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 125 selfloop transitions, 22 changer transitions 0/164 dead transitions. [2025-03-04 10:06:55,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 164 transitions, 1340 flow [2025-03-04 10:06:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:06:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:06:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 453 transitions. [2025-03-04 10:06:55,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6291666666666667 [2025-03-04 10:06:55,639 INFO L175 Difference]: Start difference. First operand has 123 places, 87 transitions, 595 flow. Second operand 12 states and 453 transitions. [2025-03-04 10:06:55,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 164 transitions, 1340 flow [2025-03-04 10:06:55,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 164 transitions, 1294 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-04 10:06:55,686 INFO L231 Difference]: Finished difference. Result has 126 places, 88 transitions, 618 flow [2025-03-04 10:06:55,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=618, PETRI_PLACES=126, PETRI_TRANSITIONS=88} [2025-03-04 10:06:55,686 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 66 predicate places. [2025-03-04 10:06:55,686 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 88 transitions, 618 flow [2025-03-04 10:06:55,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 30.12) internal successors, (753), 25 states have internal predecessors, (753), 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:06:55,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:55,686 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:55,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:06:55,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:06:55,887 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:55,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:55,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1535537070, now seen corresponding path program 1 times [2025-03-04 10:06:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:55,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750720164] [2025-03-04 10:06:55,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:55,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:06:55,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:06:55,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:55,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:56,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750720164] [2025-03-04 10:06:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750720164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:56,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446437812] [2025-03-04 10:06:56,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:56,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:56,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:56,161 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:56,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:06:56,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:06:56,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:06:56,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:56,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:56,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 10:06:56,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:56,288 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:06:56,399 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:56,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:06:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:06:56,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:56,555 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:06:56,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446437812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:56,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:56,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 5] total 21 [2025-03-04 10:06:56,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011802385] [2025-03-04 10:06:56,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:56,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:06:56,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:56,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:06:56,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:06:57,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-04 10:06:57,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 88 transitions, 618 flow. Second operand has 22 states, 22 states have (on average 27.454545454545453) internal successors, (604), 22 states have internal predecessors, (604), 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:06:57,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:57,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-04 10:06:57,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:59,385 INFO L124 PetriNetUnfolderBase]: 9391/18167 cut-off events. [2025-03-04 10:06:59,385 INFO L125 PetriNetUnfolderBase]: For 59294/61810 co-relation queries the response was YES. [2025-03-04 10:06:59,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61502 conditions, 18167 events. 9391/18167 cut-off events. For 59294/61810 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 156983 event pairs, 2903 based on Foata normal form. 966/18898 useless extension candidates. Maximal degree in co-relation 61282. Up to 5070 conditions per place. [2025-03-04 10:06:59,487 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 132 selfloop transitions, 22 changer transitions 0/171 dead transitions. [2025-03-04 10:06:59,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 171 transitions, 1588 flow [2025-03-04 10:06:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:06:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:06:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 409 transitions. [2025-03-04 10:06:59,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5680555555555555 [2025-03-04 10:06:59,488 INFO L175 Difference]: Start difference. First operand has 126 places, 88 transitions, 618 flow. Second operand 12 states and 409 transitions. [2025-03-04 10:06:59,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 171 transitions, 1588 flow [2025-03-04 10:06:59,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 171 transitions, 1504 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-03-04 10:06:59,527 INFO L231 Difference]: Finished difference. Result has 130 places, 91 transitions, 650 flow [2025-03-04 10:06:59,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=650, PETRI_PLACES=130, PETRI_TRANSITIONS=91} [2025-03-04 10:06:59,527 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 70 predicate places. [2025-03-04 10:06:59,527 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 91 transitions, 650 flow [2025-03-04 10:06:59,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 27.454545454545453) internal successors, (604), 22 states have internal predecessors, (604), 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:06:59,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:59,528 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:59,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:59,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:59,728 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:06:59,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1817599501, now seen corresponding path program 1 times [2025-03-04 10:06:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:59,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128409965] [2025-03-04 10:06:59,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:59,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:59,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:06:59,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:06:59,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:59,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-04 10:06:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128409965] [2025-03-04 10:06:59,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128409965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:59,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245645958] [2025-03-04 10:06:59,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:59,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:59,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:59,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:06:59,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:07:00,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:07:00,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:07:00,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:00,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:00,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:07:00,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:00,090 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:07:00,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:00,174 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 16 treesize of output 11 [2025-03-04 10:07:00,179 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:00,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:07:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:00,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:00,395 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 52 treesize of output 48 [2025-03-04 10:07:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:00,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245645958] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:00,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2025-03-04 10:07:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821800575] [2025-03-04 10:07:00,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:00,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 10:07:00,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:00,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 10:07:00,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:07:04,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:08,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:13,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:17,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:21,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:25,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:29,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:33,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:07:33,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 60 [2025-03-04 10:07:33,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 91 transitions, 650 flow. Second operand has 29 states, 29 states have (on average 18.620689655172413) internal successors, (540), 29 states have internal predecessors, (540), 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,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:33,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 60 [2025-03-04 10:07:33,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:37,377 INFO L124 PetriNetUnfolderBase]: 14571/23772 cut-off events. [2025-03-04 10:07:37,377 INFO L125 PetriNetUnfolderBase]: For 86662/90802 co-relation queries the response was YES. [2025-03-04 10:07:37,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86153 conditions, 23772 events. 14571/23772 cut-off events. For 86662/90802 co-relation queries the response was YES. Maximal size of possible extension queue 692. Compared 176770 event pairs, 2903 based on Foata normal form. 966/24613 useless extension candidates. Maximal degree in co-relation 85930. Up to 4748 conditions per place. [2025-03-04 10:07:37,534 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 156 selfloop transitions, 24 changer transitions 0/195 dead transitions. [2025-03-04 10:07:37,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 195 transitions, 1787 flow [2025-03-04 10:07:37,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:07:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:07:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 415 transitions. [2025-03-04 10:07:37,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2025-03-04 10:07:37,536 INFO L175 Difference]: Start difference. First operand has 130 places, 91 transitions, 650 flow. Second operand 18 states and 415 transitions. [2025-03-04 10:07:37,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 195 transitions, 1787 flow [2025-03-04 10:07:37,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 195 transitions, 1752 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:37,636 INFO L231 Difference]: Finished difference. Result has 144 places, 92 transitions, 688 flow [2025-03-04 10:07:37,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=688, PETRI_PLACES=144, PETRI_TRANSITIONS=92} [2025-03-04 10:07:37,636 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 84 predicate places. [2025-03-04 10:07:37,637 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 92 transitions, 688 flow [2025-03-04 10:07:37,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 18.620689655172413) internal successors, (540), 29 states have internal predecessors, (540), 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,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:37,637 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:37,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 10:07:37,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:37,838 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:37,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:37,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1844335434, now seen corresponding path program 2 times [2025-03-04 10:07:37,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:37,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277510605] [2025-03-04 10:07:37,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:37,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:37,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:07:37,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:07:37,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:37,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-04 10:07:38,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277510605] [2025-03-04 10:07:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277510605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612759210] [2025-03-04 10:07:38,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:38,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:38,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:38,161 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:07:38,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:07:38,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-04 10:07:38,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 10:07:38,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:38,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:38,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-04 10:07:38,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:38,289 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:07:38,320 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 10:07:38,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 10:07:38,325 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:07:38,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:38,492 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-04 10:07:38,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-04 10:07:38,498 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:38,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:07:38,829 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:38,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:39,283 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 10 treesize of output 8 [2025-03-04 10:07:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-04 10:07:39,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612759210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:39,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:39,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 34 [2025-03-04 10:07:39,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390224063] [2025-03-04 10:07:39,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:39,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:07:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:39,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:07:39,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:07:40,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2025-03-04 10:07:40,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 92 transitions, 688 flow. Second operand has 36 states, 36 states have (on average 19.583333333333332) internal successors, (705), 36 states have internal predecessors, (705), 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:40,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:40,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2025-03-04 10:07:40,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:46,276 INFO L124 PetriNetUnfolderBase]: 29665/45492 cut-off events. [2025-03-04 10:07:46,276 INFO L125 PetriNetUnfolderBase]: For 205160/209787 co-relation queries the response was YES. [2025-03-04 10:07:46,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175608 conditions, 45492 events. 29665/45492 cut-off events. For 205160/209787 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 336244 event pairs, 2145 based on Foata normal form. 900/43487 useless extension candidates. Maximal degree in co-relation 175381. Up to 6889 conditions per place. [2025-03-04 10:07:46,894 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 240 selfloop transitions, 29 changer transitions 0/280 dead transitions. [2025-03-04 10:07:46,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 280 transitions, 2566 flow [2025-03-04 10:07:46,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:07:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:07:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 582 transitions. [2025-03-04 10:07:46,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4217391304347826 [2025-03-04 10:07:46,895 INFO L175 Difference]: Start difference. First operand has 144 places, 92 transitions, 688 flow. Second operand 23 states and 582 transitions. [2025-03-04 10:07:46,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 280 transitions, 2566 flow [2025-03-04 10:07:47,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 280 transitions, 2414 flow, removed 8 selfloop flow, removed 20 redundant places. [2025-03-04 10:07:47,173 INFO L231 Difference]: Finished difference. Result has 146 places, 93 transitions, 692 flow [2025-03-04 10:07:47,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=692, PETRI_PLACES=146, PETRI_TRANSITIONS=93} [2025-03-04 10:07:47,173 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 86 predicate places. [2025-03-04 10:07:47,173 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 93 transitions, 692 flow [2025-03-04 10:07:47,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 19.583333333333332) internal successors, (705), 36 states have internal predecessors, (705), 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:47,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:47,174 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:47,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:07:47,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:47,374 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:47,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2122445204, now seen corresponding path program 1 times [2025-03-04 10:07:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677339549] [2025-03-04 10:07:47,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:47,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 10:07:47,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 10:07:47,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:47,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-04 10:07:47,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:47,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677339549] [2025-03-04 10:07:47,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677339549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:47,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:07:47,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029613039] [2025-03-04 10:07:47,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:47,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:07:47,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:47,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:07:47,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:07:47,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-04 10:07:47,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 93 transitions, 692 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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:47,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:47,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-04 10:07:47,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:50,319 INFO L124 PetriNetUnfolderBase]: 11754/19983 cut-off events. [2025-03-04 10:07:50,319 INFO L125 PetriNetUnfolderBase]: For 86363/90473 co-relation queries the response was YES. [2025-03-04 10:07:50,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73494 conditions, 19983 events. 11754/19983 cut-off events. For 86363/90473 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 156184 event pairs, 9122 based on Foata normal form. 30/18943 useless extension candidates. Maximal degree in co-relation 73266. Up to 14599 conditions per place. [2025-03-04 10:07:50,451 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 94 selfloop transitions, 2 changer transitions 1/116 dead transitions. [2025-03-04 10:07:50,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 116 transitions, 1041 flow [2025-03-04 10:07:50,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:07:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:07:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2025-03-04 10:07:50,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7388888888888889 [2025-03-04 10:07:50,452 INFO L175 Difference]: Start difference. First operand has 146 places, 93 transitions, 692 flow. Second operand 3 states and 133 transitions. [2025-03-04 10:07:50,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 116 transitions, 1041 flow [2025-03-04 10:07:50,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 116 transitions, 990 flow, removed 0 selfloop flow, removed 19 redundant places. [2025-03-04 10:07:50,558 INFO L231 Difference]: Finished difference. Result has 130 places, 93 transitions, 649 flow [2025-03-04 10:07:50,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=130, PETRI_TRANSITIONS=93} [2025-03-04 10:07:50,559 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 70 predicate places. [2025-03-04 10:07:50,559 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 93 transitions, 649 flow [2025-03-04 10:07:50,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 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,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:50,559 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:50,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:07:50,559 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-04 10:07:50,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1339824316, now seen corresponding path program 2 times [2025-03-04 10:07:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:50,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336975675] [2025-03-04 10:07:50,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:50,573 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:07:50,578 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-04 10:07:50,578 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:50,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-04 10:07:50,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336975675] [2025-03-04 10:07:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336975675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:50,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955605913] [2025-03-04 10:07:50,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:50,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:50,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:50,801 INFO L229 MonitoredProcess]: Starting monitored process 18 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:50,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:07:50,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-04 10:07:50,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-04 10:07:50,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:50,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:50,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 10:07:50,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:50,986 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:50,993 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:07:51,098 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:07:51,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 10:07:51,129 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 10:07:51,129 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:07:51,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:51,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:07:51,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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:07:51,387 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 10:07:51,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-04 10:07:51,664 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-04 10:07:51,664 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-04 10:07:52,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955605913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:52,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:52,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-04 10:07:52,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206226636] [2025-03-04 10:07:52,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:52,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:52,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:52,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:07:53,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 10:07:53,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 93 transitions, 649 flow. Second operand has 14 states, 14 states have (on average 24.642857142857142) internal successors, (345), 14 states have internal predecessors, (345), 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:53,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:53,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 10:07:53,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand