./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.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-array-int-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:06:19,278 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:06:19,327 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:19,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:06:19,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:06:19,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:06:19,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:06:19,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:06:19,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:06:19,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:06:19,353 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:06:19,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:06:19,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:06:19,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:06:19,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:06:19,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:06:19,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:06:19,354 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:06:19,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:19,355 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:06:19,355 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:06:19,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:06:19,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:06:19,356 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:06:19,356 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:06:19,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:06:19,356 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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-03-04 10:06:19,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:06:19,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:06:19,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:06:19,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:06:19,565 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:06:19,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-04 10:06:20,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97dbaff2/959e145836a7407b8559ba85910c8754/FLAG93866037f [2025-03-04 10:06:20,914 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:06:20,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-03-04 10:06:20,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97dbaff2/959e145836a7407b8559ba85910c8754/FLAG93866037f [2025-03-04 10:06:21,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e97dbaff2/959e145836a7407b8559ba85910c8754 [2025-03-04 10:06:21,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:06:21,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:06:21,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:21,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:06:21,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:06:21,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:21" (1/1) ... [2025-03-04 10:06:21,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7488c963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:21, skipping insertion in model container [2025-03-04 10:06:21,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:06:21" (1/1) ... [2025-03-04 10:06:21,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:06:21,395 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:21,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:21,409 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:06:21,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:06:21,446 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:06:21,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:21 WrapperNode [2025-03-04 10:06:21,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:06:21,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:21,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:06:21,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:06:21,453 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:21" (1/1) ... [2025-03-04 10:06:21,458 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:21" (1/1) ... [2025-03-04 10:06:21,483 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 183 [2025-03-04 10:06:21,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:06:21,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:06:21,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:06:21,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:06:21,492 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:21" (1/1) ... [2025-03-04 10:06:21,492 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:21" (1/1) ... [2025-03-04 10:06:21,496 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:21" (1/1) ... [2025-03-04 10:06:21,513 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 10:06:21,513 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:21" (1/1) ... [2025-03-04 10:06:21,514 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:21" (1/1) ... [2025-03-04 10:06:21,520 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:21" (1/1) ... [2025-03-04 10:06:21,522 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:21" (1/1) ... [2025-03-04 10:06:21,522 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:21" (1/1) ... [2025-03-04 10:06:21,523 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:21" (1/1) ... [2025-03-04 10:06:21,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:06:21,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:06:21,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:06:21,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:06:21,526 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:21" (1/1) ... [2025-03-04 10:06:21,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:06:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:21,551 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:21,553 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:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:06:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:06:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:06:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:06:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:06:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:06:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:06:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:06:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:06:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:06:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:06:21,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:06:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:06:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:06:21,571 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:21,648 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:06:21,649 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:06:21,945 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:06:21,945 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:06:22,146 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:06:22,146 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:06:22,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:22 BoogieIcfgContainer [2025-03-04 10:06:22,147 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:06:22,149 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:06:22,149 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:06:22,152 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:06:22,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:06:21" (1/3) ... [2025-03-04 10:06:22,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4115dbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:22, skipping insertion in model container [2025-03-04 10:06:22,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:06:21" (2/3) ... [2025-03-04 10:06:22,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4115dbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:06:22, skipping insertion in model container [2025-03-04 10:06:22,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:06:22" (3/3) ... [2025-03-04 10:06:22,156 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-03-04 10:06:22,166 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:06:22,167 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 55 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-03-04 10:06:22,168 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:06:22,223 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 10:06:22,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 60 transitions, 134 flow [2025-03-04 10:06:22,280 INFO L124 PetriNetUnfolderBase]: 6/58 cut-off events. [2025-03-04 10:06:22,283 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 10:06:22,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 6/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 164 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2025-03-04 10:06:22,288 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 60 transitions, 134 flow [2025-03-04 10:06:22,290 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 57 transitions, 126 flow [2025-03-04 10:06:22,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:06:22,304 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;@3e3c1df2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:06:22,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-04 10:06:22,306 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:06:22,307 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:06:22,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:06:22,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:22,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:22,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 564242, now seen corresponding path program 1 times [2025-03-04 10:06:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925598115] [2025-03-04 10:06:22,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:22,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:22,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:22,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:22,477 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:22,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:22,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925598115] [2025-03-04 10:06:22,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925598115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:22,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:22,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:06:22,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839166424] [2025-03-04 10:06:22,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:22,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:06:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:22,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:06:22,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:06:22,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-04 10:06:22,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:22,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:22,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-04 10:06:22,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:22,635 INFO L124 PetriNetUnfolderBase]: 105/252 cut-off events. [2025-03-04 10:06:22,635 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 10:06:22,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 252 events. 105/252 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1143 event pairs, 58 based on Foata normal form. 1/160 useless extension candidates. Maximal degree in co-relation 386. Up to 166 conditions per place. [2025-03-04 10:06:22,639 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 22 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-03-04 10:06:22,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 166 flow [2025-03-04 10:06:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:06:22,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:06:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2025-03-04 10:06:22,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-03-04 10:06:22,650 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 3 states and 123 transitions. [2025-03-04 10:06:22,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 166 flow [2025-03-04 10:06:22,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 158 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:22,657 INFO L231 Difference]: Finished difference. Result has 52 places, 53 transitions, 114 flow [2025-03-04 10:06:22,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=52, PETRI_TRANSITIONS=53} [2025-03-04 10:06:22,661 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -6 predicate places. [2025-03-04 10:06:22,662 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 53 transitions, 114 flow [2025-03-04 10:06:22,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 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:22,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:22,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:06:22,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:06:22,663 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:22,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 564243, now seen corresponding path program 1 times [2025-03-04 10:06:22,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:22,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877993322] [2025-03-04 10:06:22,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:22,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:06:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:06:22,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:22,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:22,903 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:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877993322] [2025-03-04 10:06:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877993322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:22,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:06:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649334628] [2025-03-04 10:06:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:22,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:22,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:22,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-04 10:06:22,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 53 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:22,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:22,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-04 10:06:22,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:23,075 INFO L124 PetriNetUnfolderBase]: 106/255 cut-off events. [2025-03-04 10:06:23,076 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:06:23,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 255 events. 106/255 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1149 event pairs, 58 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 412. Up to 175 conditions per place. [2025-03-04 10:06:23,078 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 25 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2025-03-04 10:06:23,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 178 flow [2025-03-04 10:06:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2025-03-04 10:06:23,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6583333333333333 [2025-03-04 10:06:23,079 INFO L175 Difference]: Start difference. First operand has 52 places, 53 transitions, 114 flow. Second operand 4 states and 158 transitions. [2025-03-04 10:06:23,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 178 flow [2025-03-04 10:06:23,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:23,081 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 137 flow [2025-03-04 10:06:23,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2025-03-04 10:06:23,082 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2025-03-04 10:06:23,082 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 137 flow [2025-03-04 10:06:23,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:23,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:23,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:06:23,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:06:23,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:23,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:23,083 INFO L85 PathProgramCache]: Analyzing trace with hash 17493669, now seen corresponding path program 1 times [2025-03-04 10:06:23,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240721401] [2025-03-04 10:06:23,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:23,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:06:23,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:06:23,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:23,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:23,262 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:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240721401] [2025-03-04 10:06:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240721401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:23,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:23,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:23,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920100432] [2025-03-04 10:06:23,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:23,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:23,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:23,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:23,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:23,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-04 10:06:23,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:23,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:23,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-04 10:06:23,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:23,487 INFO L124 PetriNetUnfolderBase]: 107/258 cut-off events. [2025-03-04 10:06:23,487 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:06:23,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 258 events. 107/258 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1163 event pairs, 58 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 433. Up to 174 conditions per place. [2025-03-04 10:06:23,491 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 25 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2025-03-04 10:06:23,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 207 flow [2025-03-04 10:06:23,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-03-04 10:06:23,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433333333333333 [2025-03-04 10:06:23,494 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 137 flow. Second operand 5 states and 193 transitions. [2025-03-04 10:06:23,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 207 flow [2025-03-04 10:06:23,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:23,495 INFO L231 Difference]: Finished difference. Result has 60 places, 59 transitions, 171 flow [2025-03-04 10:06:23,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=60, PETRI_TRANSITIONS=59} [2025-03-04 10:06:23,495 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2025-03-04 10:06:23,495 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 171 flow [2025-03-04 10:06:23,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:23,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:23,496 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:06:23,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:06:23,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:23,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:23,496 INFO L85 PathProgramCache]: Analyzing trace with hash 542254957, now seen corresponding path program 1 times [2025-03-04 10:06:23,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:23,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777896324] [2025-03-04 10:06:23,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:23,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:23,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:23,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:23,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:23,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:23,665 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:23,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777896324] [2025-03-04 10:06:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777896324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788005334] [2025-03-04 10:06:23,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:23,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:23,670 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:23,672 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:23,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:06:23,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:06:23,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:23,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:23,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:06:23,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:23,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:06:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:23,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:24,027 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:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788005334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:24,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:06:24,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225229367] [2025-03-04 10:06:24,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:24,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:24,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:24,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-04 10:06:24,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 171 flow. Second operand has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 11 states have internal predecessors, (367), 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:24,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:24,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-04 10:06:24,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:24,514 INFO L124 PetriNetUnfolderBase]: 107/257 cut-off events. [2025-03-04 10:06:24,514 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 10:06:24,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 257 events. 107/257 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1152 event pairs, 58 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 443. Up to 174 conditions per place. [2025-03-04 10:06:24,516 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 24 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2025-03-04 10:06:24,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 229 flow [2025-03-04 10:06:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:24,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2025-03-04 10:06:24,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138888888888889 [2025-03-04 10:06:24,519 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 171 flow. Second operand 6 states and 221 transitions. [2025-03-04 10:06:24,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 229 flow [2025-03-04 10:06:24,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 58 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:24,520 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 180 flow [2025-03-04 10:06:24,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-03-04 10:06:24,521 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2025-03-04 10:06:24,521 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 180 flow [2025-03-04 10:06:24,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.36363636363637) internal successors, (367), 11 states have internal predecessors, (367), 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:24,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:24,521 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 10:06:24,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:06:24,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:24,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:24,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash -368435391, now seen corresponding path program 1 times [2025-03-04 10:06:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408250571] [2025-03-04 10:06:24,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:24,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:06:24,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:06:24,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:24,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:24,905 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:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408250571] [2025-03-04 10:06:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408250571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345530640] [2025-03-04 10:06:24,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:24,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:24,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:24,909 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:24,910 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:24,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:06:24,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:06:24,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:24,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:24,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:06:24,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:24,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:06:25,101 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:25,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:25,226 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:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345530640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:25,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:25,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:06:25,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938527413] [2025-03-04 10:06:25,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:25,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:06:25,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:25,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:06:25,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:25,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-04 10:06:25,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 180 flow. Second operand has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 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,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:25,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-04 10:06:25,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:26,025 INFO L124 PetriNetUnfolderBase]: 109/262 cut-off events. [2025-03-04 10:06:26,025 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 10:06:26,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 262 events. 109/262 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1176 event pairs, 58 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 451. Up to 167 conditions per place. [2025-03-04 10:06:26,028 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 18 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2025-03-04 10:06:26,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 281 flow [2025-03-04 10:06:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 326 transitions. [2025-03-04 10:06:26,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6037037037037037 [2025-03-04 10:06:26,030 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 180 flow. Second operand 9 states and 326 transitions. [2025-03-04 10:06:26,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 281 flow [2025-03-04 10:06:26,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 63 transitions, 234 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-04 10:06:26,032 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 198 flow [2025-03-04 10:06:26,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=198, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2025-03-04 10:06:26,034 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2025-03-04 10:06:26,034 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 198 flow [2025-03-04 10:06:26,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.30769230769231) internal successors, (433), 13 states have internal predecessors, (433), 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,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:26,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:26,041 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:26,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:26,235 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:26,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:26,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1466350822, now seen corresponding path program 1 times [2025-03-04 10:06:26,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:26,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779160268] [2025-03-04 10:06:26,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:26,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:06:26,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:06:26,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,287 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:26,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779160268] [2025-03-04 10:06:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779160268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045480825] [2025-03-04 10:06:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:26,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:26,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:26,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:26,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:06:26,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 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,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:26,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:06:26,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:26,417 INFO L124 PetriNetUnfolderBase]: 176/448 cut-off events. [2025-03-04 10:06:26,418 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 10:06:26,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 448 events. 176/448 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2396 event pairs, 74 based on Foata normal form. 12/325 useless extension candidates. Maximal degree in co-relation 522. Up to 206 conditions per place. [2025-03-04 10:06:26,422 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 62 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2025-03-04 10:06:26,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 439 flow [2025-03-04 10:06:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2025-03-04 10:06:26,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 10:06:26,425 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 198 flow. Second operand 6 states and 255 transitions. [2025-03-04 10:06:26,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 439 flow [2025-03-04 10:06:26,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 94 transitions, 386 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:26,429 INFO L231 Difference]: Finished difference. Result has 65 places, 66 transitions, 202 flow [2025-03-04 10:06:26,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2025-03-04 10:06:26,430 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 7 predicate places. [2025-03-04 10:06:26,430 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 202 flow [2025-03-04 10:06:26,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 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,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:26,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:26,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:06:26,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:26,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash -689501376, now seen corresponding path program 1 times [2025-03-04 10:06:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:26,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763913216] [2025-03-04 10:06:26,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:26,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:06:26,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:06:26,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:06:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763913216] [2025-03-04 10:06:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763913216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:06:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227051720] [2025-03-04 10:06:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:26,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:26,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:26,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:06:26,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:26,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:06:26,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:26,632 INFO L124 PetriNetUnfolderBase]: 276/740 cut-off events. [2025-03-04 10:06:26,632 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-03-04 10:06:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1372 conditions, 740 events. 276/740 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4776 event pairs, 114 based on Foata normal form. 12/539 useless extension candidates. Maximal degree in co-relation 844. Up to 305 conditions per place. [2025-03-04 10:06:26,637 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 9 changer transitions 0/89 dead transitions. [2025-03-04 10:06:26,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 385 flow [2025-03-04 10:06:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-03-04 10:06:26,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.72 [2025-03-04 10:06:26,639 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 202 flow. Second operand 5 states and 216 transitions. [2025-03-04 10:06:26,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 385 flow [2025-03-04 10:06:26,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:26,642 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 237 flow [2025-03-04 10:06:26,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2025-03-04 10:06:26,643 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 11 predicate places. [2025-03-04 10:06:26,643 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 237 flow [2025-03-04 10:06:26,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:26,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:26,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:06:26,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:26,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 408566090, now seen corresponding path program 1 times [2025-03-04 10:06:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519241440] [2025-03-04 10:06:26,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:26,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:06:26,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:06:26,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519241440] [2025-03-04 10:06:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519241440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:26,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:26,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:06:26,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121702082] [2025-03-04 10:06:26,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:26,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:26,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:26,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:26,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:06:26,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:26,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:06:26,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:26,818 INFO L124 PetriNetUnfolderBase]: 224/706 cut-off events. [2025-03-04 10:06:26,819 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2025-03-04 10:06:26,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 706 events. 224/706 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4715 event pairs, 122 based on Foata normal form. 14/521 useless extension candidates. Maximal degree in co-relation 784. Up to 307 conditions per place. [2025-03-04 10:06:26,821 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 58 selfloop transitions, 6 changer transitions 0/90 dead transitions. [2025-03-04 10:06:26,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 442 flow [2025-03-04 10:06:26,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 248 transitions. [2025-03-04 10:06:26,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2025-03-04 10:06:26,823 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 237 flow. Second operand 6 states and 248 transitions. [2025-03-04 10:06:26,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 442 flow [2025-03-04 10:06:26,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:26,826 INFO L231 Difference]: Finished difference. Result has 75 places, 69 transitions, 254 flow [2025-03-04 10:06:26,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=75, PETRI_TRANSITIONS=69} [2025-03-04 10:06:26,826 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2025-03-04 10:06:26,827 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 69 transitions, 254 flow [2025-03-04 10:06:26,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 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,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:26,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:06:26,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1191159516, now seen corresponding path program 1 times [2025-03-04 10:06:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673473354] [2025-03-04 10:06:26,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:26,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:06:26,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:26,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:26,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673473354] [2025-03-04 10:06:26,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673473354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:26,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:26,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:06:26,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832816199] [2025-03-04 10:06:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:26,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:26,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:26,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:26,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:26,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:06:26,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 69 transitions, 254 flow. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 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,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:26,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:06:26,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:27,000 INFO L124 PetriNetUnfolderBase]: 185/523 cut-off events. [2025-03-04 10:06:27,000 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2025-03-04 10:06:27,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 523 events. 185/523 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3003 event pairs, 99 based on Foata normal form. 7/413 useless extension candidates. Maximal degree in co-relation 750. Up to 253 conditions per place. [2025-03-04 10:06:27,002 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 50 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-03-04 10:06:27,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 429 flow [2025-03-04 10:06:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:27,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2025-03-04 10:06:27,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966666666666667 [2025-03-04 10:06:27,003 INFO L175 Difference]: Start difference. First operand has 75 places, 69 transitions, 254 flow. Second operand 5 states and 209 transitions. [2025-03-04 10:06:27,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 429 flow [2025-03-04 10:06:27,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 85 transitions, 421 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:27,005 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 286 flow [2025-03-04 10:06:27,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=286, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-03-04 10:06:27,006 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2025-03-04 10:06:27,006 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 286 flow [2025-03-04 10:06:27,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 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:27,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:27,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:27,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:06:27,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:27,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash 281450148, now seen corresponding path program 1 times [2025-03-04 10:06:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:27,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076040812] [2025-03-04 10:06:27,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:27,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:06:27,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:27,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:06:27,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076040812] [2025-03-04 10:06:27,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076040812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:27,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:27,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:27,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032594055] [2025-03-04 10:06:27,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:27,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:27,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:27,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:27,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:27,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-04 10:06:27,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:27,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:27,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-04 10:06:27,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:27,232 INFO L124 PetriNetUnfolderBase]: 225/604 cut-off events. [2025-03-04 10:06:27,232 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2025-03-04 10:06:27,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 604 events. 225/604 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3477 event pairs, 163 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 746. Up to 404 conditions per place. [2025-03-04 10:06:27,236 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 39 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2025-03-04 10:06:27,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 372 flow [2025-03-04 10:06:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:06:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:06:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2025-03-04 10:06:27,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-04 10:06:27,237 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 286 flow. Second operand 5 states and 156 transitions. [2025-03-04 10:06:27,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 372 flow [2025-03-04 10:06:27,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 67 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:27,239 INFO L231 Difference]: Finished difference. Result has 76 places, 67 transitions, 282 flow [2025-03-04 10:06:27,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=76, PETRI_TRANSITIONS=67} [2025-03-04 10:06:27,240 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2025-03-04 10:06:27,240 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 282 flow [2025-03-04 10:06:27,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 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:27,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:27,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:27,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:06:27,240 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:27,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:27,240 INFO L85 PathProgramCache]: Analyzing trace with hash 281450149, now seen corresponding path program 1 times [2025-03-04 10:06:27,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744922456] [2025-03-04 10:06:27,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:27,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:06:27,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:27,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:27,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:27,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744922456] [2025-03-04 10:06:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744922456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:27,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108980185] [2025-03-04 10:06:27,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:27,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:27,395 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:27,397 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:27,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:06:27,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:06:27,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:27,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:27,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:06:27,450 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,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:27,492 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:27,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:27,502 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:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:27,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:27,630 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:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:27,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108980185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:27,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:27,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-04 10:06:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756529962] [2025-03-04 10:06:27,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:27,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:06:27,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:27,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:06:27,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:28,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:28,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 282 flow. Second operand has 13 states, 13 states have (on average 30.0) internal successors, (390), 13 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:28,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:28,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:28,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:28,428 INFO L124 PetriNetUnfolderBase]: 363/889 cut-off events. [2025-03-04 10:06:28,428 INFO L125 PetriNetUnfolderBase]: For 469/469 co-relation queries the response was YES. [2025-03-04 10:06:28,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1916 conditions, 889 events. 363/889 cut-off events. For 469/469 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5201 event pairs, 115 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1324. Up to 232 conditions per place. [2025-03-04 10:06:28,432 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 76 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2025-03-04 10:06:28,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 112 transitions, 600 flow [2025-03-04 10:06:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 334 transitions. [2025-03-04 10:06:28,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6185185185185185 [2025-03-04 10:06:28,433 INFO L175 Difference]: Start difference. First operand has 76 places, 67 transitions, 282 flow. Second operand 9 states and 334 transitions. [2025-03-04 10:06:28,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 112 transitions, 600 flow [2025-03-04 10:06:28,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 112 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:28,435 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 331 flow [2025-03-04 10:06:28,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=331, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2025-03-04 10:06:28,436 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2025-03-04 10:06:28,436 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 331 flow [2025-03-04 10:06:28,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 30.0) internal successors, (390), 13 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:28,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:28,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:28,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:28,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:28,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:28,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:28,637 INFO L85 PathProgramCache]: Analyzing trace with hash 135020528, now seen corresponding path program 1 times [2025-03-04 10:06:28,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:28,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742338892] [2025-03-04 10:06:28,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:28,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:28,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:28,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:28,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:28,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:28,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:28,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742338892] [2025-03-04 10:06:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742338892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:28,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:06:28,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914095557] [2025-03-04 10:06:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:28,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:06:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:28,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:06:28,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:06:28,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-03-04 10:06:28,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:28,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-03-04 10:06:28,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:28,780 INFO L124 PetriNetUnfolderBase]: 393/942 cut-off events. [2025-03-04 10:06:28,780 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2025-03-04 10:06:28,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 942 events. 393/942 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5400 event pairs, 301 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 1526. Up to 686 conditions per place. [2025-03-04 10:06:28,785 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 43 selfloop transitions, 7 changer transitions 0/66 dead transitions. [2025-03-04 10:06:28,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 66 transitions, 423 flow [2025-03-04 10:06:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:06:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:06:28,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-03-04 10:06:28,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5458333333333333 [2025-03-04 10:06:28,786 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 331 flow. Second operand 4 states and 131 transitions. [2025-03-04 10:06:28,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 66 transitions, 423 flow [2025-03-04 10:06:28,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 393 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:28,788 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 307 flow [2025-03-04 10:06:28,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-03-04 10:06:28,790 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2025-03-04 10:06:28,791 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 307 flow [2025-03-04 10:06:28,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:28,791 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:28,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:06:28,791 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:28,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 135020529, now seen corresponding path program 1 times [2025-03-04 10:06:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871010925] [2025-03-04 10:06:28,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:28,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:28,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:28,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:28,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:28,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:28,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871010925] [2025-03-04 10:06:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871010925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943796871] [2025-03-04 10:06:28,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:28,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:28,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:28,930 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:28,932 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:28,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:06:28,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:06:28,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:28,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:28,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:06:28,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:29,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:29,080 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 22 treesize of output 18 [2025-03-04 10:06:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:29,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943796871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:29,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:29,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:06:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612883806] [2025-03-04 10:06:29,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:29,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:29,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:29,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-03-04 10:06:29,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 307 flow. Second operand has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 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,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:29,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-03-04 10:06:29,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:29,579 INFO L124 PetriNetUnfolderBase]: 325/759 cut-off events. [2025-03-04 10:06:29,579 INFO L125 PetriNetUnfolderBase]: For 558/558 co-relation queries the response was YES. [2025-03-04 10:06:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 759 events. 325/759 cut-off events. For 558/558 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4078 event pairs, 107 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 1173. Up to 201 conditions per place. [2025-03-04 10:06:29,582 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 69 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-04 10:06:29,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 575 flow [2025-03-04 10:06:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 291 transitions. [2025-03-04 10:06:29,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6928571428571428 [2025-03-04 10:06:29,584 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 307 flow. Second operand 7 states and 291 transitions. [2025-03-04 10:06:29,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 575 flow [2025-03-04 10:06:29,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 102 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:29,586 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 349 flow [2025-03-04 10:06:29,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2025-03-04 10:06:29,587 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 23 predicate places. [2025-03-04 10:06:29,587 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 349 flow [2025-03-04 10:06:29,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.72727272727273) internal successors, (360), 11 states have internal predecessors, (360), 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,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:29,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:29,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:06:29,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:29,788 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:29,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -114648183, now seen corresponding path program 1 times [2025-03-04 10:06:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736217308] [2025-03-04 10:06:29,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:29,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:06:29,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:06:29,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:29,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736217308] [2025-03-04 10:06:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736217308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850276264] [2025-03-04 10:06:29,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:29,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:29,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:29,913 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:29,914 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:29,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:06:29,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:06:29,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:29,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:29,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:06:29,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:29,971 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:29,974 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,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:06:30,003 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:30,010 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:30,010 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,060 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:30,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:30,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850276264] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:30,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:30,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 11 [2025-03-04 10:06:30,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794092058] [2025-03-04 10:06:30,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:30,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:06:30,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:30,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:06:30,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:06:30,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-03-04 10:06:30,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:30,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:30,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-03-04 10:06:30,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:30,656 INFO L124 PetriNetUnfolderBase]: 396/960 cut-off events. [2025-03-04 10:06:30,656 INFO L125 PetriNetUnfolderBase]: For 1095/1115 co-relation queries the response was YES. [2025-03-04 10:06:30,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2307 conditions, 960 events. 396/960 cut-off events. For 1095/1115 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5685 event pairs, 171 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1668. Up to 319 conditions per place. [2025-03-04 10:06:30,660 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 60 selfloop transitions, 16 changer transitions 0/92 dead transitions. [2025-03-04 10:06:30,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 601 flow [2025-03-04 10:06:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:06:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:06:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 310 transitions. [2025-03-04 10:06:30,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-04 10:06:30,661 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 349 flow. Second operand 8 states and 310 transitions. [2025-03-04 10:06:30,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 601 flow [2025-03-04 10:06:30,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 92 transitions, 567 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:30,665 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 366 flow [2025-03-04 10:06:30,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=366, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2025-03-04 10:06:30,666 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-03-04 10:06:30,666 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 366 flow [2025-03-04 10:06:30,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:06:30,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:30,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:30,672 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:30,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:06:30,867 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:30,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:30,867 INFO L85 PathProgramCache]: Analyzing trace with hash 740874143, now seen corresponding path program 1 times [2025-03-04 10:06:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345480902] [2025-03-04 10:06:30,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:30,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:30,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:06:30,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:06:30,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:30,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345480902] [2025-03-04 10:06:30,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345480902] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051820339] [2025-03-04 10:06:30,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:30,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:30,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:30,977 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:30,979 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:31,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:06:31,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:06:31,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:31,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:31,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:06:31,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:31,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:31,121 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 22 treesize of output 18 [2025-03-04 10:06:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:31,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051820339] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:31,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:31,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:06:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442420421] [2025-03-04 10:06:31,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:31,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:06:31,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:31,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:06:31,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:06:31,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-04 10:06:31,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 366 flow. Second operand has 11 states, 11 states have (on average 32.09090909090909) internal successors, (353), 11 states have internal predecessors, (353), 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,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:31,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-04 10:06:31,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:31,630 INFO L124 PetriNetUnfolderBase]: 606/1280 cut-off events. [2025-03-04 10:06:31,631 INFO L125 PetriNetUnfolderBase]: For 1533/1579 co-relation queries the response was YES. [2025-03-04 10:06:31,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1280 events. 606/1280 cut-off events. For 1533/1579 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7484 event pairs, 170 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 2646. Up to 353 conditions per place. [2025-03-04 10:06:31,636 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 70 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2025-03-04 10:06:31,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 102 transitions, 673 flow [2025-03-04 10:06:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:31,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 282 transitions. [2025-03-04 10:06:31,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2025-03-04 10:06:31,637 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 366 flow. Second operand 7 states and 282 transitions. [2025-03-04 10:06:31,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 102 transitions, 673 flow [2025-03-04 10:06:31,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 102 transitions, 639 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-04 10:06:31,641 INFO L231 Difference]: Finished difference. Result has 84 places, 67 transitions, 388 flow [2025-03-04 10:06:31,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=84, PETRI_TRANSITIONS=67} [2025-03-04 10:06:31,642 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2025-03-04 10:06:31,642 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 67 transitions, 388 flow [2025-03-04 10:06:31,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.09090909090909) internal successors, (353), 11 states have internal predecessors, (353), 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,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:31,642 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:31,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:06:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:06:31,846 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:31,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1987274773, now seen corresponding path program 1 times [2025-03-04 10:06:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291747494] [2025-03-04 10:06:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:31,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:06:31,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:06:31,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:31,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291747494] [2025-03-04 10:06:31,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291747494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:31,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476904389] [2025-03-04 10:06:31,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:31,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:31,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:31,921 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:31,922 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:31,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:06:31,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:06:31,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:31,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:31,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:06:31,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:32,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:32,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476904389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:32,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:32,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 10:06:32,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943055798] [2025-03-04 10:06:32,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:32,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:06:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:32,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:06:32,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:06:32,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:06:32,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 67 transitions, 388 flow. Second operand has 16 states, 16 states have (on average 35.0) internal successors, (560), 16 states have internal predecessors, (560), 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,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:32,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:06:32,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:32,730 INFO L124 PetriNetUnfolderBase]: 1350/3036 cut-off events. [2025-03-04 10:06:32,730 INFO L125 PetriNetUnfolderBase]: For 4268/4356 co-relation queries the response was YES. [2025-03-04 10:06:32,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7954 conditions, 3036 events. 1350/3036 cut-off events. For 4268/4356 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 22815 event pairs, 430 based on Foata normal form. 66/2953 useless extension candidates. Maximal degree in co-relation 2901. Up to 741 conditions per place. [2025-03-04 10:06:32,743 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 156 selfloop transitions, 35 changer transitions 0/209 dead transitions. [2025-03-04 10:06:32,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 209 transitions, 1465 flow [2025-03-04 10:06:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:06:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:06:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 858 transitions. [2025-03-04 10:06:32,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.680952380952381 [2025-03-04 10:06:32,745 INFO L175 Difference]: Start difference. First operand has 84 places, 67 transitions, 388 flow. Second operand 21 states and 858 transitions. [2025-03-04 10:06:32,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 209 transitions, 1465 flow [2025-03-04 10:06:32,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 209 transitions, 1402 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:32,752 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 602 flow [2025-03-04 10:06:32,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=602, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-03-04 10:06:32,753 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 48 predicate places. [2025-03-04 10:06:32,753 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 602 flow [2025-03-04 10:06:32,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.0) internal successors, (560), 16 states have internal predecessors, (560), 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,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:32,753 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:32,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:32,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:32,954 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:32,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash -454820017, now seen corresponding path program 1 times [2025-03-04 10:06:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254131796] [2025-03-04 10:06:32,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:32,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:06:32,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:06:32,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:32,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:33,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:33,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254131796] [2025-03-04 10:06:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254131796] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:33,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677240262] [2025-03-04 10:06:33,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:33,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:33,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:33,012 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:33,013 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:33,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:06:33,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:06:33,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:33,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:33,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:06:33,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:33,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:33,178 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677240262] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:33,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-04 10:06:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979961185] [2025-03-04 10:06:33,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:06:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:33,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:06:33,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:06:33,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:06:33,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 602 flow. Second operand has 16 states, 16 states have (on average 35.25) internal successors, (564), 16 states have internal predecessors, (564), 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,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:33,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:06:33,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:33,749 INFO L124 PetriNetUnfolderBase]: 1081/2516 cut-off events. [2025-03-04 10:06:33,749 INFO L125 PetriNetUnfolderBase]: For 4650/4760 co-relation queries the response was YES. [2025-03-04 10:06:33,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6760 conditions, 2516 events. 1081/2516 cut-off events. For 4650/4760 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18240 event pairs, 441 based on Foata normal form. 48/2511 useless extension candidates. Maximal degree in co-relation 6712. Up to 754 conditions per place. [2025-03-04 10:06:33,761 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 138 selfloop transitions, 35 changer transitions 0/191 dead transitions. [2025-03-04 10:06:33,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 191 transitions, 1433 flow [2025-03-04 10:06:33,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 10:06:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 10:06:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 849 transitions. [2025-03-04 10:06:33,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6738095238095239 [2025-03-04 10:06:33,763 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 602 flow. Second operand 21 states and 849 transitions. [2025-03-04 10:06:33,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 191 transitions, 1433 flow [2025-03-04 10:06:33,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1430 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:06:33,768 INFO L231 Difference]: Finished difference. Result has 128 places, 92 transitions, 753 flow [2025-03-04 10:06:33,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=753, PETRI_PLACES=128, PETRI_TRANSITIONS=92} [2025-03-04 10:06:33,769 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 70 predicate places. [2025-03-04 10:06:33,769 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 92 transitions, 753 flow [2025-03-04 10:06:33,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.25) internal successors, (564), 16 states have internal predecessors, (564), 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,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:33,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:33,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:06:33,969 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,SelfDestructingSolverStorable16 [2025-03-04 10:06:33,970 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:33,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1636922748, now seen corresponding path program 1 times [2025-03-04 10:06:33,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050665832] [2025-03-04 10:06:33,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:33,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:06:33,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:06:33,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:33,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:34,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:34,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050665832] [2025-03-04 10:06:34,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050665832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:34,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:34,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:06:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869904655] [2025-03-04 10:06:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:34,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:06:34,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:34,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:06:34,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:06:34,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-04 10:06:34,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 92 transitions, 753 flow. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 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:34,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:34,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-04 10:06:34,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:34,330 INFO L124 PetriNetUnfolderBase]: 926/2381 cut-off events. [2025-03-04 10:06:34,330 INFO L125 PetriNetUnfolderBase]: For 5811/5889 co-relation queries the response was YES. [2025-03-04 10:06:34,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6707 conditions, 2381 events. 926/2381 cut-off events. For 5811/5889 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17992 event pairs, 370 based on Foata normal form. 1/2309 useless extension candidates. Maximal degree in co-relation 6651. Up to 1578 conditions per place. [2025-03-04 10:06:34,341 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 69 selfloop transitions, 20 changer transitions 11/119 dead transitions. [2025-03-04 10:06:34,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 119 transitions, 1158 flow [2025-03-04 10:06:34,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2025-03-04 10:06:34,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2025-03-04 10:06:34,342 INFO L175 Difference]: Start difference. First operand has 128 places, 92 transitions, 753 flow. Second operand 6 states and 250 transitions. [2025-03-04 10:06:34,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 119 transitions, 1158 flow [2025-03-04 10:06:34,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 1125 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-04 10:06:34,349 INFO L231 Difference]: Finished difference. Result has 125 places, 105 transitions, 956 flow [2025-03-04 10:06:34,349 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=956, PETRI_PLACES=125, PETRI_TRANSITIONS=105} [2025-03-04 10:06:34,349 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 67 predicate places. [2025-03-04 10:06:34,349 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 105 transitions, 956 flow [2025-03-04 10:06:34,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 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:34,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:34,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:34,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 10:06:34,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:34,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash 897945308, now seen corresponding path program 1 times [2025-03-04 10:06:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535316214] [2025-03-04 10:06:34,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:34,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:06:34,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:06:34,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:34,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:34,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535316214] [2025-03-04 10:06:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535316214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719164776] [2025-03-04 10:06:34,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:34,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:34,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:34,430 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:34,431 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:34,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:06:34,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:06:34,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:34,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:34,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:06:34,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:34,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719164776] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:34,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:34,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-03-04 10:06:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127973252] [2025-03-04 10:06:34,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:06:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:34,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:06:34,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:06:34,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-04 10:06:34,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 105 transitions, 956 flow. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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:34,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:34,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-04 10:06:34,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:34,900 INFO L124 PetriNetUnfolderBase]: 914/2361 cut-off events. [2025-03-04 10:06:34,901 INFO L125 PetriNetUnfolderBase]: For 6511/6589 co-relation queries the response was YES. [2025-03-04 10:06:34,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 2361 events. 914/2361 cut-off events. For 6511/6589 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17965 event pairs, 622 based on Foata normal form. 2/2291 useless extension candidates. Maximal degree in co-relation 6805. Up to 1525 conditions per place. [2025-03-04 10:06:34,914 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 70 selfloop transitions, 27 changer transitions 11/127 dead transitions. [2025-03-04 10:06:34,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 1242 flow [2025-03-04 10:06:34,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:06:34,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:06:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 324 transitions. [2025-03-04 10:06:34,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-03-04 10:06:34,915 INFO L175 Difference]: Start difference. First operand has 125 places, 105 transitions, 956 flow. Second operand 8 states and 324 transitions. [2025-03-04 10:06:34,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 1242 flow [2025-03-04 10:06:34,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 1216 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:34,926 INFO L231 Difference]: Finished difference. Result has 128 places, 105 transitions, 961 flow [2025-03-04 10:06:34,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=961, PETRI_PLACES=128, PETRI_TRANSITIONS=105} [2025-03-04 10:06:34,927 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 70 predicate places. [2025-03-04 10:06:34,927 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 105 transitions, 961 flow [2025-03-04 10:06:34,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 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:34,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:34,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:34,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:35,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:35,128 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:35,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:35,128 INFO L85 PathProgramCache]: Analyzing trace with hash 130459416, now seen corresponding path program 1 times [2025-03-04 10:06:35,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:35,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030452578] [2025-03-04 10:06:35,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:35,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:06:35,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:06:35,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:35,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030452578] [2025-03-04 10:06:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030452578] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687305267] [2025-03-04 10:06:35,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:35,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:35,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:35,224 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:35,225 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:35,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:06:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:06:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:35,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:06:35,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:06:35,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:06:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687305267] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:35,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 15 [2025-03-04 10:06:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895694498] [2025-03-04 10:06:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:06:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:35,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:06:35,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:06:35,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-04 10:06:35,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 105 transitions, 961 flow. Second operand has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 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,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:35,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-04 10:06:35,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:35,671 INFO L124 PetriNetUnfolderBase]: 898/2276 cut-off events. [2025-03-04 10:06:35,671 INFO L125 PetriNetUnfolderBase]: For 6264/6354 co-relation queries the response was YES. [2025-03-04 10:06:35,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 2276 events. 898/2276 cut-off events. For 6264/6354 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17185 event pairs, 613 based on Foata normal form. 2/2191 useless extension candidates. Maximal degree in co-relation 6541. Up to 1433 conditions per place. [2025-03-04 10:06:35,678 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 72 selfloop transitions, 30 changer transitions 11/132 dead transitions. [2025-03-04 10:06:35,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 1256 flow [2025-03-04 10:06:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:06:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:06:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 370 transitions. [2025-03-04 10:06:35,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2025-03-04 10:06:35,680 INFO L175 Difference]: Start difference. First operand has 128 places, 105 transitions, 961 flow. Second operand 9 states and 370 transitions. [2025-03-04 10:06:35,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 1256 flow [2025-03-04 10:06:35,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 132 transitions, 1230 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:35,686 INFO L231 Difference]: Finished difference. Result has 133 places, 101 transitions, 951 flow [2025-03-04 10:06:35,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=133, PETRI_TRANSITIONS=101} [2025-03-04 10:06:35,686 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 75 predicate places. [2025-03-04 10:06:35,687 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 101 transitions, 951 flow [2025-03-04 10:06:35,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 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,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:35,687 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:35,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:06:35,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:35,888 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:35,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:35,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1923395113, now seen corresponding path program 2 times [2025-03-04 10:06:35,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:35,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612915104] [2025-03-04 10:06:35,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:35,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:35,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:06:35,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:06:35,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:35,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:36,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612915104] [2025-03-04 10:06:36,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612915104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:36,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348466836] [2025-03-04 10:06:36,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:36,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:36,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:36,098 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:36,100 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:36,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:06:36,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:06:36,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:36,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:36,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:06:36,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:36,164 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:36,195 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:36,195 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:36,200 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:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:36,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:36,401 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:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:36,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348466836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:36,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:36,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 21 [2025-03-04 10:06:36,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662926402] [2025-03-04 10:06:36,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:36,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:06:36,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:36,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:06:36,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:06:37,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-04 10:06:37,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 101 transitions, 951 flow. Second operand has 23 states, 23 states have (on average 29.08695652173913) internal successors, (669), 23 states have internal predecessors, (669), 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,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:37,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-04 10:06:37,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:38,933 INFO L124 PetriNetUnfolderBase]: 2517/5342 cut-off events. [2025-03-04 10:06:38,933 INFO L125 PetriNetUnfolderBase]: For 12594/12831 co-relation queries the response was YES. [2025-03-04 10:06:38,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15503 conditions, 5342 events. 2517/5342 cut-off events. For 12594/12831 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 41635 event pairs, 674 based on Foata normal form. 66/5336 useless extension candidates. Maximal degree in co-relation 15275. Up to 708 conditions per place. [2025-03-04 10:06:39,000 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 215 selfloop transitions, 40 changer transitions 0/269 dead transitions. [2025-03-04 10:06:39,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 269 transitions, 2293 flow [2025-03-04 10:06:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:06:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:06:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 724 transitions. [2025-03-04 10:06:39,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6350877192982456 [2025-03-04 10:06:39,001 INFO L175 Difference]: Start difference. First operand has 133 places, 101 transitions, 951 flow. Second operand 19 states and 724 transitions. [2025-03-04 10:06:39,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 269 transitions, 2293 flow [2025-03-04 10:06:39,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 269 transitions, 2232 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:39,012 INFO L231 Difference]: Finished difference. Result has 151 places, 113 transitions, 1155 flow [2025-03-04 10:06:39,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1155, PETRI_PLACES=151, PETRI_TRANSITIONS=113} [2025-03-04 10:06:39,013 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 93 predicate places. [2025-03-04 10:06:39,013 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 113 transitions, 1155 flow [2025-03-04 10:06:39,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 29.08695652173913) internal successors, (669), 23 states have internal predecessors, (669), 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:39,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:39,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:39,019 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:39,214 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,SelfDestructingSolverStorable20 [2025-03-04 10:06:39,214 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:39,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:39,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1446423932, now seen corresponding path program 2 times [2025-03-04 10:06:39,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:39,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662846402] [2025-03-04 10:06:39,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:39,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:39,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-04 10:06:39,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 19 statements. [2025-03-04 10:06:39,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:06:39,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:39,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:39,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:39,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662846402] [2025-03-04 10:06:39,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662846402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:06:39,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:06:39,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:06:39,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957023100] [2025-03-04 10:06:39,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:39,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:06:39,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:39,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:06:39,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:06:39,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-04 10:06:39,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 113 transitions, 1155 flow. Second operand has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 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:39,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:39,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-04 10:06:39,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:39,841 INFO L124 PetriNetUnfolderBase]: 2581/6712 cut-off events. [2025-03-04 10:06:39,841 INFO L125 PetriNetUnfolderBase]: For 18144/18446 co-relation queries the response was YES. [2025-03-04 10:06:39,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19096 conditions, 6712 events. 2581/6712 cut-off events. For 18144/18446 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 64485 event pairs, 292 based on Foata normal form. 28/6656 useless extension candidates. Maximal degree in co-relation 17633. Up to 1887 conditions per place. [2025-03-04 10:06:39,870 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 90 selfloop transitions, 29 changer transitions 20/161 dead transitions. [2025-03-04 10:06:39,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 161 transitions, 1852 flow [2025-03-04 10:06:39,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:06:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:06:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2025-03-04 10:06:39,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 10:06:39,871 INFO L175 Difference]: Start difference. First operand has 151 places, 113 transitions, 1155 flow. Second operand 6 states and 255 transitions. [2025-03-04 10:06:39,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 161 transitions, 1852 flow [2025-03-04 10:06:39,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 161 transitions, 1777 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 10:06:39,886 INFO L231 Difference]: Finished difference. Result has 153 places, 101 transitions, 1046 flow [2025-03-04 10:06:39,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=153, PETRI_TRANSITIONS=101} [2025-03-04 10:06:39,887 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 95 predicate places. [2025-03-04 10:06:39,887 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 101 transitions, 1046 flow [2025-03-04 10:06:39,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.2) internal successors, (186), 5 states have internal predecessors, (186), 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:39,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:39,887 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:39,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 10:06:39,887 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:39,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -504293139, now seen corresponding path program 1 times [2025-03-04 10:06:39,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:39,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114348377] [2025-03-04 10:06:39,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:39,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:39,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:39,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:39,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:39,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:06:40,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114348377] [2025-03-04 10:06:40,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114348377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:40,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990747247] [2025-03-04 10:06:40,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:40,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:40,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:40,044 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:40,046 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:40,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:06:40,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:06:40,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:40,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:40,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:06:40,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:06:40,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:40,313 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:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:06:40,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990747247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:40,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:40,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 10:06:40,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900727385] [2025-03-04 10:06:40,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:40,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:06:40,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:40,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:06:40,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:06:40,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 60 [2025-03-04 10:06:40,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 101 transitions, 1046 flow. Second operand has 20 states, 20 states have (on average 32.8) internal successors, (656), 20 states have internal predecessors, (656), 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,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:40,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 60 [2025-03-04 10:06:40,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:41,823 INFO L124 PetriNetUnfolderBase]: 3133/6907 cut-off events. [2025-03-04 10:06:41,823 INFO L125 PetriNetUnfolderBase]: For 19647/20013 co-relation queries the response was YES. [2025-03-04 10:06:41,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21274 conditions, 6907 events. 3133/6907 cut-off events. For 19647/20013 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 61139 event pairs, 831 based on Foata normal form. 72/6830 useless extension candidates. Maximal degree in co-relation 19408. Up to 1384 conditions per place. [2025-03-04 10:06:41,856 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 131 selfloop transitions, 34 changer transitions 0/184 dead transitions. [2025-03-04 10:06:41,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 184 transitions, 1790 flow [2025-03-04 10:06:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:06:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:06:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 421 transitions. [2025-03-04 10:06:41,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7016666666666667 [2025-03-04 10:06:41,857 INFO L175 Difference]: Start difference. First operand has 153 places, 101 transitions, 1046 flow. Second operand 10 states and 421 transitions. [2025-03-04 10:06:41,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 184 transitions, 1790 flow [2025-03-04 10:06:41,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 1676 flow, removed 9 selfloop flow, removed 12 redundant places. [2025-03-04 10:06:41,872 INFO L231 Difference]: Finished difference. Result has 140 places, 103 transitions, 1043 flow [2025-03-04 10:06:41,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1043, PETRI_PLACES=140, PETRI_TRANSITIONS=103} [2025-03-04 10:06:41,872 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 82 predicate places. [2025-03-04 10:06:41,872 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 103 transitions, 1043 flow [2025-03-04 10:06:41,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 32.8) internal successors, (656), 20 states have internal predecessors, (656), 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,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:41,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:41,878 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:42,077 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,SelfDestructingSolverStorable22 [2025-03-04 10:06:42,077 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:42,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:42,077 INFO L85 PathProgramCache]: Analyzing trace with hash 222971260, now seen corresponding path program 1 times [2025-03-04 10:06:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:42,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788838338] [2025-03-04 10:06:42,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:42,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:42,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:06:42,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:06:42,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:42,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:42,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:06:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:42,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788838338] [2025-03-04 10:06:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788838338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211225398] [2025-03-04 10:06:42,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:42,203 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:42,207 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:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:06:42,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:06:42,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:42,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:42,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:06:42,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:06:42,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:06:42,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211225398] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 15 [2025-03-04 10:06:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286790172] [2025-03-04 10:06:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:42,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:06:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:42,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:06:42,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:06:42,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-04 10:06:42,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 103 transitions, 1043 flow. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:42,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-04 10:06:42,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:43,013 INFO L124 PetriNetUnfolderBase]: 3032/6899 cut-off events. [2025-03-04 10:06:43,014 INFO L125 PetriNetUnfolderBase]: For 21886/22349 co-relation queries the response was YES. [2025-03-04 10:06:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21613 conditions, 6899 events. 3032/6899 cut-off events. For 21886/22349 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 60846 event pairs, 1043 based on Foata normal form. 205/6993 useless extension candidates. Maximal degree in co-relation 19995. Up to 3137 conditions per place. [2025-03-04 10:06:43,049 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 85 selfloop transitions, 20 changer transitions 0/127 dead transitions. [2025-03-04 10:06:43,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 127 transitions, 1511 flow [2025-03-04 10:06:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 264 transitions. [2025-03-04 10:06:43,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-04 10:06:43,050 INFO L175 Difference]: Start difference. First operand has 140 places, 103 transitions, 1043 flow. Second operand 7 states and 264 transitions. [2025-03-04 10:06:43,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 127 transitions, 1511 flow [2025-03-04 10:06:43,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 127 transitions, 1489 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:06:43,065 INFO L231 Difference]: Finished difference. Result has 145 places, 104 transitions, 1103 flow [2025-03-04 10:06:43,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1103, PETRI_PLACES=145, PETRI_TRANSITIONS=104} [2025-03-04 10:06:43,066 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 87 predicate places. [2025-03-04 10:06:43,066 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 104 transitions, 1103 flow [2025-03-04 10:06:43,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 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,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:43,066 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:43,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:43,268 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,SelfDestructingSolverStorable23 [2025-03-04 10:06:43,268 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:43,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash -397443571, now seen corresponding path program 2 times [2025-03-04 10:06:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:43,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613125187] [2025-03-04 10:06:43,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:43,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:06:43,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:06:43,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:43,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:43,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:43,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613125187] [2025-03-04 10:06:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613125187] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:43,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141205238] [2025-03-04 10:06:43,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:43,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:43,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:43,528 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:43,529 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:43,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 10:06:43,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:06:43,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:43,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:43,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:06:43,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:43,604 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:43,670 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:06:43,670 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 16 treesize of output 15 [2025-03-04 10:06:43,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:06:43,679 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:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:43,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:43,914 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,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141205238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:44,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:44,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 22 [2025-03-04 10:06:44,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22483331] [2025-03-04 10:06:44,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:44,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:06:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:44,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:06:44,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:06:45,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-04 10:06:45,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 104 transitions, 1103 flow. Second operand has 24 states, 24 states have (on average 23.375) internal successors, (561), 24 states have internal predecessors, (561), 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,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:45,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-04 10:06:45,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:48,069 INFO L124 PetriNetUnfolderBase]: 7247/13645 cut-off events. [2025-03-04 10:06:48,069 INFO L125 PetriNetUnfolderBase]: For 46012/46012 co-relation queries the response was YES. [2025-03-04 10:06:48,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46329 conditions, 13645 events. 7247/13645 cut-off events. For 46012/46012 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 109421 event pairs, 356 based on Foata normal form. 272/13908 useless extension candidates. Maximal degree in co-relation 41993. Up to 3118 conditions per place. [2025-03-04 10:06:48,157 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 241 selfloop transitions, 45 changer transitions 0/299 dead transitions. [2025-03-04 10:06:48,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 299 transitions, 3231 flow [2025-03-04 10:06:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:06:48,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 10:06:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 665 transitions. [2025-03-04 10:06:48,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2025-03-04 10:06:48,158 INFO L175 Difference]: Start difference. First operand has 145 places, 104 transitions, 1103 flow. Second operand 23 states and 665 transitions. [2025-03-04 10:06:48,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 299 transitions, 3231 flow [2025-03-04 10:06:48,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 299 transitions, 3165 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 10:06:48,220 INFO L231 Difference]: Finished difference. Result has 165 places, 121 transitions, 1317 flow [2025-03-04 10:06:48,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1317, PETRI_PLACES=165, PETRI_TRANSITIONS=121} [2025-03-04 10:06:48,221 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 107 predicate places. [2025-03-04 10:06:48,221 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 121 transitions, 1317 flow [2025-03-04 10:06:48,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 23.375) internal successors, (561), 24 states have internal predecessors, (561), 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,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:48,221 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:48,227 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:48,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:48,422 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:48,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash 564151707, now seen corresponding path program 1 times [2025-03-04 10:06:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:48,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262865163] [2025-03-04 10:06:48,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:48,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:06:48,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:06:48,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:48,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:06:48,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262865163] [2025-03-04 10:06:48,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262865163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:48,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172965664] [2025-03-04 10:06:48,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:48,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:48,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:48,567 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:48,569 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:06:48,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:06:48,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:06:48,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:48,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:48,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:06:48,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:06:48,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:48,808 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:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:06:48,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172965664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:48,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:48,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 10:06:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171282321] [2025-03-04 10:06:48,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:48,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:06:48,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:48,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:06:48,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:06:49,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-04 10:06:49,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 121 transitions, 1317 flow. Second operand has 20 states, 20 states have (on average 32.1) internal successors, (642), 20 states have internal predecessors, (642), 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:49,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:49,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-04 10:06:49,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:50,456 INFO L124 PetriNetUnfolderBase]: 5020/10306 cut-off events. [2025-03-04 10:06:50,456 INFO L125 PetriNetUnfolderBase]: For 42353/42590 co-relation queries the response was YES. [2025-03-04 10:06:50,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36130 conditions, 10306 events. 5020/10306 cut-off events. For 42353/42590 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 88130 event pairs, 967 based on Foata normal form. 142/10256 useless extension candidates. Maximal degree in co-relation 33014. Up to 2390 conditions per place. [2025-03-04 10:06:50,528 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 163 selfloop transitions, 28 changer transitions 0/223 dead transitions. [2025-03-04 10:06:50,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 223 transitions, 2529 flow [2025-03-04 10:06:50,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:06:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:06:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 407 transitions. [2025-03-04 10:06:50,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6783333333333333 [2025-03-04 10:06:50,529 INFO L175 Difference]: Start difference. First operand has 165 places, 121 transitions, 1317 flow. Second operand 10 states and 407 transitions. [2025-03-04 10:06:50,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 223 transitions, 2529 flow [2025-03-04 10:06:50,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 223 transitions, 2467 flow, removed 10 selfloop flow, removed 11 redundant places. [2025-03-04 10:06:50,575 INFO L231 Difference]: Finished difference. Result has 166 places, 125 transitions, 1369 flow [2025-03-04 10:06:50,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1369, PETRI_PLACES=166, PETRI_TRANSITIONS=125} [2025-03-04 10:06:50,576 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 108 predicate places. [2025-03-04 10:06:50,576 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 125 transitions, 1369 flow [2025-03-04 10:06:50,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 32.1) internal successors, (642), 20 states have internal predecessors, (642), 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,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:50,576 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:50,583 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:06:50,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 10:06:50,777 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:50,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:50,777 INFO L85 PathProgramCache]: Analyzing trace with hash -509713817, now seen corresponding path program 2 times [2025-03-04 10:06:50,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:50,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975156725] [2025-03-04 10:06:50,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:50,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:50,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:06:50,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:06:50,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975156725] [2025-03-04 10:06:50,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975156725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932516997] [2025-03-04 10:06:50,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:06:50,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:50,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:50,890 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:06:50,892 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:06:50,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:06:50,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:06:50,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:06:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:50,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:06:50,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:51,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:06:51,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932516997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:51,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:51,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 10:06:51,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457388248] [2025-03-04 10:06:51,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:51,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:06:51,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:51,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:06:51,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:06:51,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:06:51,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 125 transitions, 1369 flow. Second operand has 19 states, 19 states have (on average 34.94736842105263) internal successors, (664), 19 states have internal predecessors, (664), 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:51,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:51,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:06:51,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:52,894 INFO L124 PetriNetUnfolderBase]: 6620/15049 cut-off events. [2025-03-04 10:06:52,894 INFO L125 PetriNetUnfolderBase]: For 76142/76670 co-relation queries the response was YES. [2025-03-04 10:06:52,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54321 conditions, 15049 events. 6620/15049 cut-off events. For 76142/76670 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 151164 event pairs, 3313 based on Foata normal form. 237/14799 useless extension candidates. Maximal degree in co-relation 51068. Up to 5630 conditions per place. [2025-03-04 10:06:53,029 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 136 selfloop transitions, 54 changer transitions 0/230 dead transitions. [2025-03-04 10:06:53,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 230 transitions, 2862 flow [2025-03-04 10:06:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:06:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:06:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 488 transitions. [2025-03-04 10:06:53,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-03-04 10:06:53,030 INFO L175 Difference]: Start difference. First operand has 166 places, 125 transitions, 1369 flow. Second operand 12 states and 488 transitions. [2025-03-04 10:06:53,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 230 transitions, 2862 flow [2025-03-04 10:06:53,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 230 transitions, 2825 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:06:53,109 INFO L231 Difference]: Finished difference. Result has 180 places, 152 transitions, 1971 flow [2025-03-04 10:06:53,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1971, PETRI_PLACES=180, PETRI_TRANSITIONS=152} [2025-03-04 10:06:53,110 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 122 predicate places. [2025-03-04 10:06:53,110 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 152 transitions, 1971 flow [2025-03-04 10:06:53,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 34.94736842105263) internal successors, (664), 19 states have internal predecessors, (664), 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,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:53,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:53,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:53,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:06:53,311 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:53,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash 464256764, now seen corresponding path program 1 times [2025-03-04 10:06:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:53,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293461995] [2025-03-04 10:06:53,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:53,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:06:53,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:06:53,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:53,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:06:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293461995] [2025-03-04 10:06:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293461995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168938455] [2025-03-04 10:06:53,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:06:53,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:53,432 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:06:53,434 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:06:53,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:06:53,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:06:53,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:06:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:53,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:06:53,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:53,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:53,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:06:53,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168938455] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:53,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:06:53,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 14 [2025-03-04 10:06:53,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117131407] [2025-03-04 10:06:53,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:06:53,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:06:53,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:53,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:06:53,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:06:53,673 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 60 [2025-03-04 10:06:53,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 152 transitions, 1971 flow. Second operand has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 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,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:53,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 60 [2025-03-04 10:06:53,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:55,421 INFO L124 PetriNetUnfolderBase]: 6902/15132 cut-off events. [2025-03-04 10:06:55,421 INFO L125 PetriNetUnfolderBase]: For 87582/88116 co-relation queries the response was YES. [2025-03-04 10:06:55,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57599 conditions, 15132 events. 6902/15132 cut-off events. For 87582/88116 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 147254 event pairs, 2715 based on Foata normal form. 436/15232 useless extension candidates. Maximal degree in co-relation 54255. Up to 6809 conditions per place. [2025-03-04 10:06:55,591 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 87 selfloop transitions, 48 changer transitions 0/174 dead transitions. [2025-03-04 10:06:55,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 174 transitions, 2475 flow [2025-03-04 10:06:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:06:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:06:55,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2025-03-04 10:06:55,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-03-04 10:06:55,592 INFO L175 Difference]: Start difference. First operand has 180 places, 152 transitions, 1971 flow. Second operand 7 states and 266 transitions. [2025-03-04 10:06:55,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 174 transitions, 2475 flow [2025-03-04 10:06:55,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 174 transitions, 2470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:06:55,717 INFO L231 Difference]: Finished difference. Result has 186 places, 153 transitions, 2161 flow [2025-03-04 10:06:55,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2161, PETRI_PLACES=186, PETRI_TRANSITIONS=153} [2025-03-04 10:06:55,721 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 128 predicate places. [2025-03-04 10:06:55,722 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 153 transitions, 2161 flow [2025-03-04 10:06:55,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 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,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:06:55,722 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:06:55,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 10:06:55,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:06:55,923 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:06:55,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:06:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -531803315, now seen corresponding path program 3 times [2025-03-04 10:06:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:06:55,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027717862] [2025-03-04 10:06:55,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:06:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:06:55,929 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-04 10:06:55,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 26 statements. [2025-03-04 10:06:55,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:06:55,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-04 10:06:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:06:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027717862] [2025-03-04 10:06:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027717862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:06:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052877549] [2025-03-04 10:06:56,032 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:06:56,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:06:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:06:56,034 INFO L229 MonitoredProcess]: Starting monitored process 19 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,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:06:56,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-04 10:06:56,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 26 statements. [2025-03-04 10:06:56,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:06:56,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:06:56,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:06:56,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:06:56,117 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,242 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 10:06:56,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:06:56,720 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 10:06:56,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052877549] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:06:56,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:06:56,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2025-03-04 10:06:56,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937422345] [2025-03-04 10:06:56,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:06:56,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:06:56,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:06:56,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:06:56,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:06:57,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-04 10:06:57,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 153 transitions, 2161 flow. Second operand has 20 states, 20 states have (on average 30.65) internal successors, (613), 20 states have internal predecessors, (613), 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,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:06:57,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-04 10:06:57,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:06:59,970 INFO L124 PetriNetUnfolderBase]: 8910/16887 cut-off events. [2025-03-04 10:06:59,970 INFO L125 PetriNetUnfolderBase]: For 110061/111007 co-relation queries the response was YES. [2025-03-04 10:07:00,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68721 conditions, 16887 events. 8910/16887 cut-off events. For 110061/111007 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 148925 event pairs, 202 based on Foata normal form. 424/17205 useless extension candidates. Maximal degree in co-relation 64341. Up to 4650 conditions per place. [2025-03-04 10:07:00,133 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 163 selfloop transitions, 65 changer transitions 0/250 dead transitions. [2025-03-04 10:07:00,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 250 transitions, 3597 flow [2025-03-04 10:07:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:07:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:07:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 428 transitions. [2025-03-04 10:07:00,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2025-03-04 10:07:00,134 INFO L175 Difference]: Start difference. First operand has 186 places, 153 transitions, 2161 flow. Second operand 12 states and 428 transitions. [2025-03-04 10:07:00,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 250 transitions, 3597 flow [2025-03-04 10:07:00,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 250 transitions, 3493 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:00,298 INFO L231 Difference]: Finished difference. Result has 189 places, 152 transitions, 2181 flow [2025-03-04 10:07:00,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2051, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2181, PETRI_PLACES=189, PETRI_TRANSITIONS=152} [2025-03-04 10:07:00,299 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 131 predicate places. [2025-03-04 10:07:00,299 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 152 transitions, 2181 flow [2025-03-04 10:07:00,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 30.65) internal successors, (613), 20 states have internal predecessors, (613), 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:00,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:00,299 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:00,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:07:00,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:07:00,501 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:00,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:00,501 INFO L85 PathProgramCache]: Analyzing trace with hash 661912725, now seen corresponding path program 2 times [2025-03-04 10:07:00,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:00,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113221735] [2025-03-04 10:07:00,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:00,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:00,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:07:00,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:07:00,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:00,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:07:00,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:00,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113221735] [2025-03-04 10:07:00,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113221735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:00,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737118866] [2025-03-04 10:07:00,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:00,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:00,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:00,600 INFO L229 MonitoredProcess]: Starting monitored process 20 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:00,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:07:00,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-04 10:07:00,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:07:00,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:00,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:00,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:07:00,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:00,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:00,867 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737118866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:00,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2025-03-04 10:07:00,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13957585] [2025-03-04 10:07:00,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:00,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:07:00,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:00,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:07:00,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:07:01,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 60 [2025-03-04 10:07:01,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 152 transitions, 2181 flow. Second operand has 22 states, 22 states have (on average 35.18181818181818) internal successors, (774), 22 states have internal predecessors, (774), 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:01,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:01,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 60 [2025-03-04 10:07:01,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:03,177 INFO L124 PetriNetUnfolderBase]: 6034/13989 cut-off events. [2025-03-04 10:07:03,177 INFO L125 PetriNetUnfolderBase]: For 95671/95995 co-relation queries the response was YES. [2025-03-04 10:07:03,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54758 conditions, 13989 events. 6034/13989 cut-off events. For 95671/95995 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 136670 event pairs, 1778 based on Foata normal form. 165/13876 useless extension candidates. Maximal degree in co-relation 52213. Up to 2577 conditions per place. [2025-03-04 10:07:03,310 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 254 selfloop transitions, 67 changer transitions 0/359 dead transitions. [2025-03-04 10:07:03,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 359 transitions, 4959 flow [2025-03-04 10:07:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:07:03,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-04 10:07:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1259 transitions. [2025-03-04 10:07:03,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6557291666666667 [2025-03-04 10:07:03,313 INFO L175 Difference]: Start difference. First operand has 189 places, 152 transitions, 2181 flow. Second operand 32 states and 1259 transitions. [2025-03-04 10:07:03,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 359 transitions, 4959 flow [2025-03-04 10:07:03,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 359 transitions, 4470 flow, removed 3 selfloop flow, removed 10 redundant places. [2025-03-04 10:07:03,465 INFO L231 Difference]: Finished difference. Result has 214 places, 175 transitions, 2511 flow [2025-03-04 10:07:03,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2511, PETRI_PLACES=214, PETRI_TRANSITIONS=175} [2025-03-04 10:07:03,466 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 156 predicate places. [2025-03-04 10:07:03,466 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 175 transitions, 2511 flow [2025-03-04 10:07:03,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 35.18181818181818) internal successors, (774), 22 states have internal predecessors, (774), 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:03,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:03,466 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:03,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:03,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:03,667 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1844002861, now seen corresponding path program 3 times [2025-03-04 10:07:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642127521] [2025-03-04 10:07:03,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:03,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:03,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 5 equivalence classes. [2025-03-04 10:07:03,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 27 statements. [2025-03-04 10:07:03,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:07:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:03,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642127521] [2025-03-04 10:07:03,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642127521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:03,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122154469] [2025-03-04 10:07:03,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:03,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:03,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:03,820 INFO L229 MonitoredProcess]: Starting monitored process 21 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:03,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:07:03,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 5 equivalence classes. [2025-03-04 10:07:03,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 27 statements. [2025-03-04 10:07:03,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:03,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:03,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 10:07:03,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:03,906 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:03,975 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:07:03,975 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 18 treesize of output 17 [2025-03-04 10:07:03,991 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:03,991 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:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:07:04,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:04,243 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 42 treesize of output 38 [2025-03-04 10:07:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 10:07:04,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122154469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:04,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:04,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 15 [2025-03-04 10:07:04,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102411617] [2025-03-04 10:07:04,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:04,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:07:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:04,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:07:04,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:07:05,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-04 10:07:05,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 175 transitions, 2511 flow. Second operand has 17 states, 17 states have (on average 28.470588235294116) internal successors, (484), 17 states have internal predecessors, (484), 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:05,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:05,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-04 10:07:05,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:07,347 INFO L124 PetriNetUnfolderBase]: 9052/17785 cut-off events. [2025-03-04 10:07:07,347 INFO L125 PetriNetUnfolderBase]: For 107319/108172 co-relation queries the response was YES. [2025-03-04 10:07:07,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69351 conditions, 17785 events. 9052/17785 cut-off events. For 107319/108172 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 160150 event pairs, 1153 based on Foata normal form. 189/17896 useless extension candidates. Maximal degree in co-relation 65705. Up to 4984 conditions per place. [2025-03-04 10:07:07,585 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 192 selfloop transitions, 55 changer transitions 0/276 dead transitions. [2025-03-04 10:07:07,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 276 transitions, 4404 flow [2025-03-04 10:07:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 304 transitions. [2025-03-04 10:07:07,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.562962962962963 [2025-03-04 10:07:07,588 INFO L175 Difference]: Start difference. First operand has 214 places, 175 transitions, 2511 flow. Second operand 9 states and 304 transitions. [2025-03-04 10:07:07,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 276 transitions, 4404 flow [2025-03-04 10:07:07,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 276 transitions, 4218 flow, removed 15 selfloop flow, removed 17 redundant places. [2025-03-04 10:07:07,889 INFO L231 Difference]: Finished difference. Result has 204 places, 174 transitions, 2437 flow [2025-03-04 10:07:07,889 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2437, PETRI_PLACES=204, PETRI_TRANSITIONS=174} [2025-03-04 10:07:07,890 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 146 predicate places. [2025-03-04 10:07:07,890 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 174 transitions, 2437 flow [2025-03-04 10:07:07,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 28.470588235294116) internal successors, (484), 17 states have internal predecessors, (484), 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:07,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:07,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:07,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:07:08,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-04 10:07:08,091 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:08,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1733455488, now seen corresponding path program 1 times [2025-03-04 10:07:08,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:08,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600768658] [2025-03-04 10:07:08,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:08,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:08,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:07:08,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:07:08,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:08,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600768658] [2025-03-04 10:07:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600768658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143717113] [2025-03-04 10:07:08,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:08,261 INFO L229 MonitoredProcess]: Starting monitored process 22 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:08,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:07:08,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:07:08,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:07:08,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:08,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:08,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:07:08,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:08,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:07:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143717113] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:08,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-03-04 10:07:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790465448] [2025-03-04 10:07:08,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:08,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:07:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:08,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:07:08,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:07:08,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 60 [2025-03-04 10:07:08,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 174 transitions, 2437 flow. Second operand has 23 states, 23 states have (on average 36.608695652173914) internal successors, (842), 23 states have internal predecessors, (842), 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:08,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:08,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 60 [2025-03-04 10:07:08,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:10,338 INFO L124 PetriNetUnfolderBase]: 4806/12006 cut-off events. [2025-03-04 10:07:10,338 INFO L125 PetriNetUnfolderBase]: For 74997/75425 co-relation queries the response was YES. [2025-03-04 10:07:10,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45913 conditions, 12006 events. 4806/12006 cut-off events. For 74997/75425 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 121760 event pairs, 2219 based on Foata normal form. 112/11884 useless extension candidates. Maximal degree in co-relation 42532. Up to 7001 conditions per place. [2025-03-04 10:07:10,477 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 151 selfloop transitions, 63 changer transitions 2/257 dead transitions. [2025-03-04 10:07:10,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 257 transitions, 3327 flow [2025-03-04 10:07:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:07:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:07:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 739 transitions. [2025-03-04 10:07:10,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6842592592592592 [2025-03-04 10:07:10,479 INFO L175 Difference]: Start difference. First operand has 204 places, 174 transitions, 2437 flow. Second operand 18 states and 739 transitions. [2025-03-04 10:07:10,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 257 transitions, 3327 flow [2025-03-04 10:07:10,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 257 transitions, 3213 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 10:07:10,607 INFO L231 Difference]: Finished difference. Result has 216 places, 187 transitions, 2624 flow [2025-03-04 10:07:10,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2327, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2624, PETRI_PLACES=216, PETRI_TRANSITIONS=187} [2025-03-04 10:07:10,608 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 158 predicate places. [2025-03-04 10:07:10,608 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 187 transitions, 2624 flow [2025-03-04 10:07:10,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 36.608695652173914) internal successors, (842), 23 states have internal predecessors, (842), 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:10,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:10,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:10,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:10,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:10,809 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:10,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:10,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1349350619, now seen corresponding path program 1 times [2025-03-04 10:07:10,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:10,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709544527] [2025-03-04 10:07:10,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:10,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:10,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:07:10,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:10,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:10,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709544527] [2025-03-04 10:07:11,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709544527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:11,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:11,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:07:11,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531625631] [2025-03-04 10:07:11,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:11,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:07:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:11,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:07:11,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:07:11,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-04 10:07:11,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 187 transitions, 2624 flow. Second operand has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 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:11,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:11,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-04 10:07:11,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:13,253 INFO L124 PetriNetUnfolderBase]: 9232/18698 cut-off events. [2025-03-04 10:07:13,254 INFO L125 PetriNetUnfolderBase]: For 103180/103671 co-relation queries the response was YES. [2025-03-04 10:07:13,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74278 conditions, 18698 events. 9232/18698 cut-off events. For 103180/103671 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 170891 event pairs, 3946 based on Foata normal form. 132/18799 useless extension candidates. Maximal degree in co-relation 68229. Up to 9379 conditions per place. [2025-03-04 10:07:13,441 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 321 selfloop transitions, 74 changer transitions 0/408 dead transitions. [2025-03-04 10:07:13,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 408 transitions, 6220 flow [2025-03-04 10:07:13,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:07:13,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:07:13,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 427 transitions. [2025-03-04 10:07:13,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.646969696969697 [2025-03-04 10:07:13,443 INFO L175 Difference]: Start difference. First operand has 216 places, 187 transitions, 2624 flow. Second operand 11 states and 427 transitions. [2025-03-04 10:07:13,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 408 transitions, 6220 flow [2025-03-04 10:07:13,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 408 transitions, 6149 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-03-04 10:07:13,665 INFO L231 Difference]: Finished difference. Result has 223 places, 207 transitions, 3135 flow [2025-03-04 10:07:13,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3135, PETRI_PLACES=223, PETRI_TRANSITIONS=207} [2025-03-04 10:07:13,666 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 165 predicate places. [2025-03-04 10:07:13,666 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 207 transitions, 3135 flow [2025-03-04 10:07:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 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:13,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:13,666 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:13,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 10:07:13,667 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1366349545, now seen corresponding path program 3 times [2025-03-04 10:07:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:13,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893476003] [2025-03-04 10:07:13,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:13,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:13,673 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 7 equivalence classes. [2025-03-04 10:07:13,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:07:13,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:07:13,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 34 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:07:13,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893476003] [2025-03-04 10:07:13,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893476003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:13,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230097969] [2025-03-04 10:07:13,793 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:13,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:13,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:13,795 INFO L229 MonitoredProcess]: Starting monitored process 23 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:13,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:07:13,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 7 equivalence classes. [2025-03-04 10:07:13,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:07:13,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-04 10:07:13,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:13,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:07:13,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 41 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:07:14,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:14,210 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 18 treesize of output 14 [2025-03-04 10:07:14,266 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 10:07:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230097969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:14,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2025-03-04 10:07:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140154792] [2025-03-04 10:07:14,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:14,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:07:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:14,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:07:14,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:07:14,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-04 10:07:14,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 207 transitions, 3135 flow. Second operand has 30 states, 30 states have (on average 30.733333333333334) internal successors, (922), 30 states have internal predecessors, (922), 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:14,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:14,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-04 10:07:14,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:17,320 INFO L124 PetriNetUnfolderBase]: 8588/17419 cut-off events. [2025-03-04 10:07:17,320 INFO L125 PetriNetUnfolderBase]: For 115836/115956 co-relation queries the response was YES. [2025-03-04 10:07:17,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75295 conditions, 17419 events. 8588/17419 cut-off events. For 115836/115956 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 157150 event pairs, 1906 based on Foata normal form. 156/17407 useless extension candidates. Maximal degree in co-relation 67326. Up to 4407 conditions per place. [2025-03-04 10:07:17,534 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 292 selfloop transitions, 90 changer transitions 1/405 dead transitions. [2025-03-04 10:07:17,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 405 transitions, 6017 flow [2025-03-04 10:07:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:07:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 10:07:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 636 transitions. [2025-03-04 10:07:17,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6235294117647059 [2025-03-04 10:07:17,535 INFO L175 Difference]: Start difference. First operand has 223 places, 207 transitions, 3135 flow. Second operand 17 states and 636 transitions. [2025-03-04 10:07:17,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 405 transitions, 6017 flow [2025-03-04 10:07:17,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 405 transitions, 5657 flow, removed 31 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:17,795 INFO L231 Difference]: Finished difference. Result has 236 places, 216 transitions, 3283 flow [2025-03-04 10:07:17,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=2956, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3283, PETRI_PLACES=236, PETRI_TRANSITIONS=216} [2025-03-04 10:07:17,795 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 178 predicate places. [2025-03-04 10:07:17,795 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 216 transitions, 3283 flow [2025-03-04 10:07:17,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 30.733333333333334) internal successors, (922), 30 states have internal predecessors, (922), 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:17,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:17,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:17,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:07:17,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:17,996 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:17,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:17,997 INFO L85 PathProgramCache]: Analyzing trace with hash -2132278109, now seen corresponding path program 1 times [2025-03-04 10:07:17,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:17,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082910617] [2025-03-04 10:07:17,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:07:17,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:18,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:07:18,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:07:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:18,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082910617] [2025-03-04 10:07:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082910617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:18,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:18,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 10:07:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120400131] [2025-03-04 10:07:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:18,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:07:18,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:18,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:07:18,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:07:18,434 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-04 10:07:18,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 216 transitions, 3283 flow. Second operand has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 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:18,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:18,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-04 10:07:18,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:20,963 INFO L124 PetriNetUnfolderBase]: 10818/21585 cut-off events. [2025-03-04 10:07:20,963 INFO L125 PetriNetUnfolderBase]: For 149594/150041 co-relation queries the response was YES. [2025-03-04 10:07:21,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95533 conditions, 21585 events. 10818/21585 cut-off events. For 149594/150041 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 195785 event pairs, 5390 based on Foata normal form. 192/21745 useless extension candidates. Maximal degree in co-relation 85904. Up to 10729 conditions per place. [2025-03-04 10:07:21,295 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 333 selfloop transitions, 110 changer transitions 9/465 dead transitions. [2025-03-04 10:07:21,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 465 transitions, 8021 flow [2025-03-04 10:07:21,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:07:21,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:07:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 430 transitions. [2025-03-04 10:07:21,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515151515151515 [2025-03-04 10:07:21,296 INFO L175 Difference]: Start difference. First operand has 236 places, 216 transitions, 3283 flow. Second operand 11 states and 430 transitions. [2025-03-04 10:07:21,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 465 transitions, 8021 flow [2025-03-04 10:07:21,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 465 transitions, 7895 flow, removed 23 selfloop flow, removed 7 redundant places. [2025-03-04 10:07:21,678 INFO L231 Difference]: Finished difference. Result has 244 places, 273 transitions, 4723 flow [2025-03-04 10:07:21,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=3185, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4723, PETRI_PLACES=244, PETRI_TRANSITIONS=273} [2025-03-04 10:07:21,679 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 186 predicate places. [2025-03-04 10:07:21,679 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 273 transitions, 4723 flow [2025-03-04 10:07:21,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 32.083333333333336) internal successors, (385), 12 states have internal predecessors, (385), 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:21,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:21,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:21,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 10:07:21,679 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:21,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1892763819, now seen corresponding path program 2 times [2025-03-04 10:07:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307284603] [2025-03-04 10:07:21,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:21,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:21,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 30 statements. [2025-03-04 10:07:21,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:07:21,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:21,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307284603] [2025-03-04 10:07:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307284603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:07:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 10:07:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401092281] [2025-03-04 10:07:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:21,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:07:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:21,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:07:21,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:07:21,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-04 10:07:21,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 273 transitions, 4723 flow. Second operand has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:21,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:21,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-04 10:07:21,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:25,572 INFO L124 PetriNetUnfolderBase]: 11418/22928 cut-off events. [2025-03-04 10:07:25,572 INFO L125 PetriNetUnfolderBase]: For 208803/209282 co-relation queries the response was YES. [2025-03-04 10:07:25,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111235 conditions, 22928 events. 11418/22928 cut-off events. For 208803/209282 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 210215 event pairs, 5383 based on Foata normal form. 139/22991 useless extension candidates. Maximal degree in co-relation 99386. Up to 11446 conditions per place. [2025-03-04 10:07:25,920 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 269 selfloop transitions, 188 changer transitions 2/472 dead transitions. [2025-03-04 10:07:25,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 472 transitions, 8939 flow [2025-03-04 10:07:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 364 transitions. [2025-03-04 10:07:25,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2025-03-04 10:07:25,922 INFO L175 Difference]: Start difference. First operand has 244 places, 273 transitions, 4723 flow. Second operand 9 states and 364 transitions. [2025-03-04 10:07:25,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 472 transitions, 8939 flow [2025-03-04 10:07:26,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 472 transitions, 8574 flow, removed 48 selfloop flow, removed 6 redundant places. [2025-03-04 10:07:26,584 INFO L231 Difference]: Finished difference. Result has 252 places, 378 transitions, 7516 flow [2025-03-04 10:07:26,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=4480, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7516, PETRI_PLACES=252, PETRI_TRANSITIONS=378} [2025-03-04 10:07:26,585 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 194 predicate places. [2025-03-04 10:07:26,585 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 378 transitions, 7516 flow [2025-03-04 10:07:26,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.5) internal successors, (325), 10 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:26,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:26,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:26,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 10:07:26,585 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:26,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:26,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1782900283, now seen corresponding path program 3 times [2025-03-04 10:07:26,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:26,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670927018] [2025-03-04 10:07:26,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:26,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:26,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:26,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:07:26,595 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:26,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:26,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670927018] [2025-03-04 10:07:26,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670927018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:26,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566616698] [2025-03-04 10:07:26,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:07:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:26,692 INFO L229 MonitoredProcess]: Starting monitored process 24 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:26,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:07:26,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:26,767 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 30 statements. [2025-03-04 10:07:26,767 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:07:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:26,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:07:26,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:26,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-04 10:07:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:26,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:26,948 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 10:07:26,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 10:07:26,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:26,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566616698] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:26,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:26,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 10:07:26,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192865379] [2025-03-04 10:07:26,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 10:07:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:26,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 10:07:26,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:07:27,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-04 10:07:27,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 378 transitions, 7516 flow. Second operand has 17 states, 17 states have (on average 32.1764705882353) internal successors, (547), 17 states have internal predecessors, (547), 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:27,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:27,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-04 10:07:27,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:31,028 INFO L124 PetriNetUnfolderBase]: 12455/24493 cut-off events. [2025-03-04 10:07:31,029 INFO L125 PetriNetUnfolderBase]: For 251935/252442 co-relation queries the response was YES. [2025-03-04 10:07:31,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126452 conditions, 24493 events. 12455/24493 cut-off events. For 251935/252442 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 223877 event pairs, 5578 based on Foata normal form. 195/24651 useless extension candidates. Maximal degree in co-relation 112190. Up to 11771 conditions per place. [2025-03-04 10:07:31,407 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 402 selfloop transitions, 189 changer transitions 4/608 dead transitions. [2025-03-04 10:07:31,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 608 transitions, 12691 flow [2025-03-04 10:07:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:07:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:07:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 364 transitions. [2025-03-04 10:07:31,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.674074074074074 [2025-03-04 10:07:31,408 INFO L175 Difference]: Start difference. First operand has 252 places, 378 transitions, 7516 flow. Second operand 9 states and 364 transitions. [2025-03-04 10:07:31,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 608 transitions, 12691 flow [2025-03-04 10:07:32,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 608 transitions, 12023 flow, removed 334 selfloop flow, removed 0 redundant places. [2025-03-04 10:07:32,540 INFO L231 Difference]: Finished difference. Result has 265 places, 452 transitions, 9343 flow [2025-03-04 10:07:32,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=7126, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9343, PETRI_PLACES=265, PETRI_TRANSITIONS=452} [2025-03-04 10:07:32,541 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 207 predicate places. [2025-03-04 10:07:32,541 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 452 transitions, 9343 flow [2025-03-04 10:07:32,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 32.1764705882353) internal successors, (547), 17 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:32,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:32,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:32,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-04 10:07:32,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:32,742 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:32,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1765115199, now seen corresponding path program 4 times [2025-03-04 10:07:32,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:32,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750836769] [2025-03-04 10:07:32,742 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:07:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:32,747 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:32,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 30 statements. [2025-03-04 10:07:32,751 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:07:32,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:32,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750836769] [2025-03-04 10:07:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750836769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:32,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352844276] [2025-03-04 10:07:32,825 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:07:32,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:32,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:32,827 INFO L229 MonitoredProcess]: Starting monitored process 25 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:32,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:07:32,875 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:32,885 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 30 statements. [2025-03-04 10:07:32,885 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 10:07:32,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:32,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:07:32,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:32,955 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 10:07:32,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-04 10:07:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:32,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:33,026 INFO L349 Elim1Store]: treesize reduction 28, result has 63.6 percent of original size [2025-03-04 10:07:33,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 56 [2025-03-04 10:07:33,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:33,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352844276] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:33,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:33,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-04 10:07:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145468810] [2025-03-04 10:07:33,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:33,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:07:33,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:33,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:07:33,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:07:33,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 60 [2025-03-04 10:07:33,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 452 transitions, 9343 flow. Second operand has 16 states, 16 states have (on average 32.1875) internal successors, (515), 16 states have internal predecessors, (515), 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,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:33,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 60 [2025-03-04 10:07:33,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:37,662 INFO L124 PetriNetUnfolderBase]: 13117/26149 cut-off events. [2025-03-04 10:07:37,662 INFO L125 PetriNetUnfolderBase]: For 248634/249152 co-relation queries the response was YES. [2025-03-04 10:07:38,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134362 conditions, 26149 events. 13117/26149 cut-off events. For 248634/249152 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 242383 event pairs, 5289 based on Foata normal form. 191/26301 useless extension candidates. Maximal degree in co-relation 119760. Up to 11885 conditions per place. [2025-03-04 10:07:38,167 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 324 selfloop transitions, 267 changer transitions 5/609 dead transitions. [2025-03-04 10:07:38,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 609 transitions, 12476 flow [2025-03-04 10:07:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:07:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:07:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 414 transitions. [2025-03-04 10:07:38,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69 [2025-03-04 10:07:38,168 INFO L175 Difference]: Start difference. First operand has 265 places, 452 transitions, 9343 flow. Second operand 10 states and 414 transitions. [2025-03-04 10:07:38,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 609 transitions, 12476 flow [2025-03-04 10:07:39,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 609 transitions, 12201 flow, removed 45 selfloop flow, removed 2 redundant places. [2025-03-04 10:07:39,342 INFO L231 Difference]: Finished difference. Result has 275 places, 467 transitions, 10023 flow [2025-03-04 10:07:39,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=9094, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10023, PETRI_PLACES=275, PETRI_TRANSITIONS=467} [2025-03-04 10:07:39,343 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 217 predicate places. [2025-03-04 10:07:39,343 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 467 transitions, 10023 flow [2025-03-04 10:07:39,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 32.1875) internal successors, (515), 16 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:39,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:39,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:39,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:07:39,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:07:39,544 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:39,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:39,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2098474335, now seen corresponding path program 2 times [2025-03-04 10:07:39,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:39,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383419785] [2025-03-04 10:07:39,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:39,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:39,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:39,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:39,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:40,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:07:40,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383419785] [2025-03-04 10:07:40,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383419785] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:40,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935997291] [2025-03-04 10:07:40,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:07:40,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:40,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:40,022 INFO L229 MonitoredProcess]: Starting monitored process 26 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:40,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:07:40,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-04 10:07:40,088 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:40,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:07:40,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:40,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:07:40,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:40,273 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 10:07:40,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2025-03-04 10:07:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:40,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:07:40,425 INFO L349 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-03-04 10:07:40,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 48 [2025-03-04 10:07:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:07:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935997291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:07:40,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:07:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 30 [2025-03-04 10:07:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884987602] [2025-03-04 10:07:40,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:07:40,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 10:07:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:40,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 10:07:40,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=775, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:07:42,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-04 10:07:42,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 467 transitions, 10023 flow. Second operand has 30 states, 30 states have (on average 26.266666666666666) internal successors, (788), 30 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:07:42,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:07:42,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-04 10:07:42,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:07:49,466 INFO L124 PetriNetUnfolderBase]: 17525/33477 cut-off events. [2025-03-04 10:07:49,467 INFO L125 PetriNetUnfolderBase]: For 319328/319737 co-relation queries the response was YES. [2025-03-04 10:07:49,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169432 conditions, 33477 events. 17525/33477 cut-off events. For 319328/319737 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 304795 event pairs, 1450 based on Foata normal form. 146/33617 useless extension candidates. Maximal degree in co-relation 152469. Up to 12954 conditions per place. [2025-03-04 10:07:50,062 INFO L140 encePairwiseOnDemand]: 43/60 looper letters, 656 selfloop transitions, 238 changer transitions 20/921 dead transitions. [2025-03-04 10:07:50,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 921 transitions, 17600 flow [2025-03-04 10:07:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-04 10:07:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-04 10:07:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 944 transitions. [2025-03-04 10:07:50,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.542528735632184 [2025-03-04 10:07:50,064 INFO L175 Difference]: Start difference. First operand has 275 places, 467 transitions, 10023 flow. Second operand 29 states and 944 transitions. [2025-03-04 10:07:50,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 921 transitions, 17600 flow [2025-03-04 10:07:52,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 921 transitions, 17044 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 10:07:52,411 INFO L231 Difference]: Finished difference. Result has 307 places, 512 transitions, 10819 flow [2025-03-04 10:07:52,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=9612, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=10819, PETRI_PLACES=307, PETRI_TRANSITIONS=512} [2025-03-04 10:07:52,412 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 249 predicate places. [2025-03-04 10:07:52,412 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 512 transitions, 10819 flow [2025-03-04 10:07:52,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 26.266666666666666) internal successors, (788), 30 states have internal predecessors, (788), 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:52,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:07:52,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:07:52,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-04 10:07:52,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:07:52,613 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2025-03-04 10:07:52,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:07:52,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1704649617, now seen corresponding path program 5 times [2025-03-04 10:07:52,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:07:52,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776966776] [2025-03-04 10:07:52,614 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:07:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:07:52,621 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:52,630 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:52,630 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:07:52,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 10:07:53,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:07:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776966776] [2025-03-04 10:07:53,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776966776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:07:53,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100853929] [2025-03-04 10:07:53,045 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:07:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:07:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:07:53,048 INFO L229 MonitoredProcess]: Starting monitored process 27 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:53,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:07:53,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-04 10:07:53,192 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:07:53,193 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 10:07:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:07:53,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:07:53,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:07:53,611 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:07:53,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-03-04 10:07:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:07:53,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:07:53,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100853929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:07:53,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:07:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 23 [2025-03-04 10:07:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258478225] [2025-03-04 10:07:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:07:53,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:07:53,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:07:53,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:07:53,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506