./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:19:36,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:19:36,327 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:19:36,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:19:36,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:19:36,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:19:36,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:19:36,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:19:36,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:19:36,352 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:19:36,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:19:36,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:19:36,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:19:36,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:19:36,353 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:19:36,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:19:36,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:19:36,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:19:36,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:19:36,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:36,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:19:36,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:19:36,356 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:19:36,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:19:36,356 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:19:36,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:19:36,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:19:36,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:19:36,357 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 -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-03-09 01:19:36,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:19:36,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:19:36,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:19:36,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:19:36,609 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:19:36,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-09 01:19:37,776 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a16e1565/d7e7fbdaf94d41a1b3e05759c875d58e/FLAGbb0cc7820 [2025-03-09 01:19:37,991 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:19:37,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-03-09 01:19:38,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a16e1565/d7e7fbdaf94d41a1b3e05759c875d58e/FLAGbb0cc7820 [2025-03-09 01:19:38,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a16e1565/d7e7fbdaf94d41a1b3e05759c875d58e [2025-03-09 01:19:38,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:19:38,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:19:38,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:38,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:19:38,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:19:38,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5f9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38, skipping insertion in model container [2025-03-09 01:19:38,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:19:38,185 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:19:38,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:38,197 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:19:38,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:19:38,234 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:19:38,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38 WrapperNode [2025-03-09 01:19:38,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:19:38,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:38,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:19:38,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:19:38,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,267 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 251 [2025-03-09 01:19:38,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:19:38,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:19:38,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:19:38,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:19:38,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,290 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-09 01:19:38,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,304 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:19:38,308 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:19:38,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:19:38,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:19:38,309 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (1/1) ... [2025-03-09 01:19:38,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:19:38,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:38,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:19:38,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:19:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:19:38,364 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:19:38,364 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:19:38,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-09 01:19:38,365 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:19:38,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:19:38,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:19:38,366 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:19:38,462 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:19:38,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:19:38,903 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:19:38,903 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:19:39,163 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:19:39,163 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:19:39,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:39 BoogieIcfgContainer [2025-03-09 01:19:39,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:19:39,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:19:39,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:19:39,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:19:39,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:19:38" (1/3) ... [2025-03-09 01:19:39,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93f9ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:39, skipping insertion in model container [2025-03-09 01:19:39,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:19:38" (2/3) ... [2025-03-09 01:19:39,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93f9ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:19:39, skipping insertion in model container [2025-03-09 01:19:39,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:19:39" (3/3) ... [2025-03-09 01:19:39,170 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-03-09 01:19:39,182 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:19:39,184 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 55 locations, 1 initial locations, 6 loop locations, and 20 error locations. [2025-03-09 01:19:39,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:19:39,230 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-09 01:19:39,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 141 flow [2025-03-09 01:19:39,293 INFO L124 PetriNetUnfolderBase]: 6/57 cut-off events. [2025-03-09 01:19:39,294 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:19:39,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 57 events. 6/57 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2025-03-09 01:19:39,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 60 transitions, 141 flow [2025-03-09 01:19:39,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 130 flow [2025-03-09 01:19:39,304 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:19:39,312 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;@21437388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:19:39,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-09 01:19:39,315 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:19:39,316 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:19:39,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:19:39,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:39,317 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:39,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:39,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash 764262, now seen corresponding path program 1 times [2025-03-09 01:19:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:39,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717738207] [2025-03-09 01:19:39,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:39,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:39,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:39,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:39,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:39,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717738207] [2025-03-09 01:19:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717738207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:19:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944157170] [2025-03-09 01:19:39,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:39,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:19:39,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:39,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:19:39,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:19:39,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:19:39,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:39,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:39,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:19:39,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:39,709 INFO L124 PetriNetUnfolderBase]: 202/407 cut-off events. [2025-03-09 01:19:39,709 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 01:19:39,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 407 events. 202/407 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1720 event pairs, 124 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 636. Up to 293 conditions per place. [2025-03-09 01:19:39,713 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-03-09 01:19:39,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 178 flow [2025-03-09 01:19:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:39,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-09 01:19:39,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-03-09 01:19:39,727 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 130 flow. Second operand 3 states and 111 transitions. [2025-03-09 01:19:39,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 178 flow [2025-03-09 01:19:39,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:39,733 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 112 flow [2025-03-09 01:19:39,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2025-03-09 01:19:39,738 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2025-03-09 01:19:39,739 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 112 flow [2025-03-09 01:19:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:39,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:39,739 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:19:39,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:19:39,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:39,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash 764263, now seen corresponding path program 1 times [2025-03-09 01:19:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:39,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513653862] [2025-03-09 01:19:39,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:39,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:19:39,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:19:39,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:39,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513653862] [2025-03-09 01:19:39,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513653862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:39,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:39,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:39,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522604744] [2025-03-09 01:19:39,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:39,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:39,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:39,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:39,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:39,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:19:39,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:39,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:39,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:19:39,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:40,121 INFO L124 PetriNetUnfolderBase]: 205/416 cut-off events. [2025-03-09 01:19:40,121 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:19:40,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 416 events. 205/416 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1755 event pairs, 124 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 698. Up to 306 conditions per place. [2025-03-09 01:19:40,124 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 34 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2025-03-09 01:19:40,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 214 flow [2025-03-09 01:19:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:19:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:19:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-03-09 01:19:40,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6777777777777778 [2025-03-09 01:19:40,127 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 112 flow. Second operand 3 states and 122 transitions. [2025-03-09 01:19:40,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 214 flow [2025-03-09 01:19:40,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 60 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:40,130 INFO L231 Difference]: Finished difference. Result has 53 places, 57 transitions, 166 flow [2025-03-09 01:19:40,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=53, PETRI_TRANSITIONS=57} [2025-03-09 01:19:40,131 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2025-03-09 01:19:40,131 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 166 flow [2025-03-09 01:19:40,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:40,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:40,131 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:19:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:19:40,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:40,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash 734480075, now seen corresponding path program 1 times [2025-03-09 01:19:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874605012] [2025-03-09 01:19:40,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:40,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:40,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:40,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:40,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874605012] [2025-03-09 01:19:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874605012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171842480] [2025-03-09 01:19:40,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:40,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:40,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:40,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:40,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:19:40,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:19:40,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:19:40,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:40,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:40,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:19:40,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:40,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:40,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:40,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:40,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171842480] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:40,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:40,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2025-03-09 01:19:40,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148941398] [2025-03-09 01:19:40,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:40,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:19:40,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:40,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:19:40,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:19:40,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:19:40,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 166 flow. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:40,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:40,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:19:40,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:40,939 INFO L124 PetriNetUnfolderBase]: 208/437 cut-off events. [2025-03-09 01:19:40,940 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:19:40,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 437 events. 208/437 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1778 event pairs, 124 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 730. Up to 307 conditions per place. [2025-03-09 01:19:40,946 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 41 selfloop transitions, 21 changer transitions 0/81 dead transitions. [2025-03-09 01:19:40,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 368 flow [2025-03-09 01:19:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:40,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2025-03-09 01:19:40,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6472222222222223 [2025-03-09 01:19:40,949 INFO L175 Difference]: Start difference. First operand has 53 places, 57 transitions, 166 flow. Second operand 6 states and 233 transitions. [2025-03-09 01:19:40,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 368 flow [2025-03-09 01:19:40,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:40,951 INFO L231 Difference]: Finished difference. Result has 59 places, 69 transitions, 292 flow [2025-03-09 01:19:40,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=59, PETRI_TRANSITIONS=69} [2025-03-09 01:19:40,952 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2025-03-09 01:19:40,953 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 69 transitions, 292 flow [2025-03-09 01:19:40,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:40,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:40,953 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2025-03-09 01:19:40,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:19:41,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:41,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:41,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -419927817, now seen corresponding path program 2 times [2025-03-09 01:19:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213825320] [2025-03-09 01:19:41,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:41,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:41,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:19:41,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:41,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:41,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:19:41,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213825320] [2025-03-09 01:19:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213825320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598449810] [2025-03-09 01:19:41,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:41,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:41,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:41,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:41,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:19:41,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-09 01:19:41,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:19:41,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:19:41,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:41,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:19:41,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:41,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:41,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:19:41,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598449810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:41,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:41,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-09 01:19:41,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70127276] [2025-03-09 01:19:41,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:41,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:19:41,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:41,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:19:41,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:19:42,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:19:42,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 69 transitions, 292 flow. Second operand has 19 states, 19 states have (on average 27.68421052631579) internal successors, (526), 19 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:42,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:42,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:19:42,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:42,574 INFO L124 PetriNetUnfolderBase]: 208/434 cut-off events. [2025-03-09 01:19:42,574 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-09 01:19:42,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 434 events. 208/434 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1757 event pairs, 124 based on Foata normal form. 3/362 useless extension candidates. Maximal degree in co-relation 762. Up to 295 conditions per place. [2025-03-09 01:19:42,577 INFO L140 encePairwiseOnDemand]: 47/60 looper letters, 22 selfloop transitions, 37 changer transitions 0/78 dead transitions. [2025-03-09 01:19:42,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 404 flow [2025-03-09 01:19:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:19:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:19:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 348 transitions. [2025-03-09 01:19:42,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-09 01:19:42,579 INFO L175 Difference]: Start difference. First operand has 59 places, 69 transitions, 292 flow. Second operand 11 states and 348 transitions. [2025-03-09 01:19:42,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 404 flow [2025-03-09 01:19:42,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 330 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:42,584 INFO L231 Difference]: Finished difference. Result has 61 places, 78 transitions, 292 flow [2025-03-09 01:19:42,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=292, PETRI_PLACES=61, PETRI_TRANSITIONS=78} [2025-03-09 01:19:42,585 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2025-03-09 01:19:42,585 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 78 transitions, 292 flow [2025-03-09 01:19:42,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 27.68421052631579) internal successors, (526), 19 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:42,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:42,586 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:42,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:42,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 01:19:42,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:42,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash -189998543, now seen corresponding path program 1 times [2025-03-09 01:19:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372620966] [2025-03-09 01:19:42,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:42,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:19:42,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:19:42,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:42,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:19:42,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372620966] [2025-03-09 01:19:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372620966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281210655] [2025-03-09 01:19:42,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:42,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:19:42,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:19:42,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:19:42,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:42,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:42,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:19:42,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:19:43,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:19:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281210655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:43,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:43,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 01:19:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603911662] [2025-03-09 01:19:43,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:43,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:43,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:43,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:43,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:19:43,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-09 01:19:43,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 78 transitions, 292 flow. Second operand has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:43,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:43,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-09 01:19:43,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:43,210 INFO L124 PetriNetUnfolderBase]: 202/431 cut-off events. [2025-03-09 01:19:43,211 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:19:43,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 431 events. 202/431 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1704 event pairs, 124 based on Foata normal form. 9/365 useless extension candidates. Maximal degree in co-relation 698. Up to 296 conditions per place. [2025-03-09 01:19:43,213 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 35 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2025-03-09 01:19:43,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 75 transitions, 380 flow [2025-03-09 01:19:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:19:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:19:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 268 transitions. [2025-03-09 01:19:43,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2025-03-09 01:19:43,215 INFO L175 Difference]: Start difference. First operand has 61 places, 78 transitions, 292 flow. Second operand 7 states and 268 transitions. [2025-03-09 01:19:43,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 75 transitions, 380 flow [2025-03-09 01:19:43,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 340 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:43,216 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 296 flow [2025-03-09 01:19:43,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2025-03-09 01:19:43,217 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-03-09 01:19:43,217 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 296 flow [2025-03-09 01:19:43,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 31.363636363636363) internal successors, (345), 11 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:43,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:43,217 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:43,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 01:19:43,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:43,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -267616590, now seen corresponding path program 1 times [2025-03-09 01:19:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:43,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527504252] [2025-03-09 01:19:43,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:43,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:19:43,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:19:43,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:43,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527504252] [2025-03-09 01:19:44,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527504252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:44,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163236084] [2025-03-09 01:19:44,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:44,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:44,429 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:44,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:19:44,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 01:19:44,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 01:19:44,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:44,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:44,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 01:19:44,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:44,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:44,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:44,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:44,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:19:44,627 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:19:44,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:19:44,712 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:44,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:44,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:44,726 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-09 01:19:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:45,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:45,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163236084] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:45,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:45,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 9] total 32 [2025-03-09 01:19:45,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681366749] [2025-03-09 01:19:45,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:45,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:45,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:45,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:45,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 01:19:46,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:19:46,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 296 flow. Second operand has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:46,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:46,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:19:46,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:46,558 INFO L124 PetriNetUnfolderBase]: 578/1087 cut-off events. [2025-03-09 01:19:46,558 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-09 01:19:46,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 1087 events. 578/1087 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5633 event pairs, 221 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1917. Up to 440 conditions per place. [2025-03-09 01:19:46,565 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 71 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2025-03-09 01:19:46,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 491 flow [2025-03-09 01:19:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:46,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2025-03-09 01:19:46,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.575 [2025-03-09 01:19:46,567 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 296 flow. Second operand 6 states and 207 transitions. [2025-03-09 01:19:46,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 491 flow [2025-03-09 01:19:46,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 458 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:19:46,569 INFO L231 Difference]: Finished difference. Result has 65 places, 76 transitions, 288 flow [2025-03-09 01:19:46,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=65, PETRI_TRANSITIONS=76} [2025-03-09 01:19:46,573 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-09 01:19:46,574 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 76 transitions, 288 flow [2025-03-09 01:19:46,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.90909090909091) internal successors, (307), 11 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:46,575 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:46,575 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:46,582 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-09 01:19:46,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:46,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:46,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash -267616591, now seen corresponding path program 2 times [2025-03-09 01:19:46,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:46,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525938777] [2025-03-09 01:19:46,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:19:46,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:46,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:19:46,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 38 statements. [2025-03-09 01:19:46,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:19:46,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-09 01:19:46,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:46,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525938777] [2025-03-09 01:19:46,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525938777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:46,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:46,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:19:46,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689342523] [2025-03-09 01:19:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:46,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:46,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:46,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:46,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:46,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-09 01:19:46,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 76 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:46,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:46,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-09 01:19:46,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:47,015 INFO L124 PetriNetUnfolderBase]: 504/916 cut-off events. [2025-03-09 01:19:47,015 INFO L125 PetriNetUnfolderBase]: For 334/349 co-relation queries the response was YES. [2025-03-09 01:19:47,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 916 events. 504/916 cut-off events. For 334/349 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4190 event pairs, 357 based on Foata normal form. 63/899 useless extension candidates. Maximal degree in co-relation 1872. Up to 730 conditions per place. [2025-03-09 01:19:47,019 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 56 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-09 01:19:47,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 402 flow [2025-03-09 01:19:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2025-03-09 01:19:47,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2025-03-09 01:19:47,020 INFO L175 Difference]: Start difference. First operand has 65 places, 76 transitions, 288 flow. Second operand 5 states and 143 transitions. [2025-03-09 01:19:47,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 402 flow [2025-03-09 01:19:47,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 394 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:47,022 INFO L231 Difference]: Finished difference. Result has 63 places, 74 transitions, 282 flow [2025-03-09 01:19:47,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=63, PETRI_TRANSITIONS=74} [2025-03-09 01:19:47,023 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2025-03-09 01:19:47,023 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 74 transitions, 282 flow [2025-03-09 01:19:47,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:47,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:47,023 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:47,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:19:47,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:47,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash 293820995, now seen corresponding path program 1 times [2025-03-09 01:19:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:47,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150149786] [2025-03-09 01:19:47,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:47,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:47,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:19:47,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:19:47,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:47,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-09 01:19:47,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:47,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150149786] [2025-03-09 01:19:47,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150149786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:47,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:19:47,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436613473] [2025-03-09 01:19:47,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:47,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:19:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:47,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:19:47,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:19:47,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 60 [2025-03-09 01:19:47,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 74 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:47,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:47,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 60 [2025-03-09 01:19:47,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:47,318 INFO L124 PetriNetUnfolderBase]: 416/806 cut-off events. [2025-03-09 01:19:47,319 INFO L125 PetriNetUnfolderBase]: For 140/169 co-relation queries the response was YES. [2025-03-09 01:19:47,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 806 events. 416/806 cut-off events. For 140/169 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3913 event pairs, 315 based on Foata normal form. 31/751 useless extension candidates. Maximal degree in co-relation 1523. Up to 616 conditions per place. [2025-03-09 01:19:47,324 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 54 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2025-03-09 01:19:47,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 392 flow [2025-03-09 01:19:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:19:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:19:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2025-03-09 01:19:47,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49 [2025-03-09 01:19:47,326 INFO L175 Difference]: Start difference. First operand has 63 places, 74 transitions, 282 flow. Second operand 5 states and 147 transitions. [2025-03-09 01:19:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 392 flow [2025-03-09 01:19:47,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 387 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:47,327 INFO L231 Difference]: Finished difference. Result has 62 places, 72 transitions, 279 flow [2025-03-09 01:19:47,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=62, PETRI_TRANSITIONS=72} [2025-03-09 01:19:47,328 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-09 01:19:47,328 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 279 flow [2025-03-09 01:19:47,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:47,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:47,328 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:47,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:19:47,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:47,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash 293820996, now seen corresponding path program 1 times [2025-03-09 01:19:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:47,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31651573] [2025-03-09 01:19:47,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:47,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:47,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:19:47,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:19:47,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:47,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:47,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31651573] [2025-03-09 01:19:47,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31651573] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:47,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718285550] [2025-03-09 01:19:47,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:47,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:47,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:19:47,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:19:47,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:19:47,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:47,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:47,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 01:19:47,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:47,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:47,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:47,820 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:47,820 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-09 01:19:47,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:19:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:48,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:48,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718285550] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:48,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:48,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 24 [2025-03-09 01:19:48,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819513853] [2025-03-09 01:19:48,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:48,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:19:48,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:48,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:19:48,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:19:48,552 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-09 01:19:48,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 279 flow. Second operand has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:48,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:48,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-09 01:19:48,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:48,720 INFO L124 PetriNetUnfolderBase]: 400/753 cut-off events. [2025-03-09 01:19:48,721 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-09 01:19:48,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 753 events. 400/753 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3324 event pairs, 169 based on Foata normal form. 26/707 useless extension candidates. Maximal degree in co-relation 1488. Up to 377 conditions per place. [2025-03-09 01:19:48,725 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 69 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2025-03-09 01:19:48,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 469 flow [2025-03-09 01:19:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2025-03-09 01:19:48,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:19:48,726 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 279 flow. Second operand 6 states and 216 transitions. [2025-03-09 01:19:48,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 469 flow [2025-03-09 01:19:48,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 464 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:19:48,728 INFO L231 Difference]: Finished difference. Result has 65 places, 73 transitions, 295 flow [2025-03-09 01:19:48,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2025-03-09 01:19:48,729 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-09 01:19:48,729 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 295 flow [2025-03-09 01:19:48,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.1) internal successors, (301), 10 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:48,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:48,729 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:48,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:48,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:48,930 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:48,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash 484352629, now seen corresponding path program 1 times [2025-03-09 01:19:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:48,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197429703] [2025-03-09 01:19:48,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:48,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:19:48,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:19:48,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:48,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:49,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197429703] [2025-03-09 01:19:49,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197429703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:49,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838524008] [2025-03-09 01:19:49,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:49,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:49,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:49,299 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:49,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:19:49,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 01:19:49,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 01:19:49,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:49,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:49,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 01:19:49,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:49,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:49,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:49,492 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:49,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:19:49,504 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:49,505 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-09 01:19:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:49,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:50,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838524008] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:50,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:50,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 9] total 25 [2025-03-09 01:19:50,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929916149] [2025-03-09 01:19:50,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:50,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:19:50,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:50,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:19:50,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2025-03-09 01:19:50,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-03-09 01:19:50,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 295 flow. Second operand has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:50,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:50,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-03-09 01:19:50,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:50,624 INFO L124 PetriNetUnfolderBase]: 775/1400 cut-off events. [2025-03-09 01:19:50,624 INFO L125 PetriNetUnfolderBase]: For 937/1040 co-relation queries the response was YES. [2025-03-09 01:19:50,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3198 conditions, 1400 events. 775/1400 cut-off events. For 937/1040 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7396 event pairs, 315 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 3065. Up to 604 conditions per place. [2025-03-09 01:19:50,633 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 69 selfloop transitions, 6 changer transitions 0/89 dead transitions. [2025-03-09 01:19:50,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 498 flow [2025-03-09 01:19:50,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2025-03-09 01:19:50,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2025-03-09 01:19:50,635 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 295 flow. Second operand 6 states and 209 transitions. [2025-03-09 01:19:50,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 498 flow [2025-03-09 01:19:50,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 488 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:50,638 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 312 flow [2025-03-09 01:19:50,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2025-03-09 01:19:50,639 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2025-03-09 01:19:50,639 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 312 flow [2025-03-09 01:19:50,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.3) internal successors, (293), 10 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:50,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:50,640 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:50,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:50,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:50,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:50,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2130030313, now seen corresponding path program 1 times [2025-03-09 01:19:50,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:50,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-03-09 01:19:50,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:50,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:19:50,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:19:50,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:50,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-09 01:19:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695310451] [2025-03-09 01:19:50,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695310451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:19:50,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:19:50,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:19:50,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747500672] [2025-03-09 01:19:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:50,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:19:50,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:50,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:19:50,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:19:50,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-03-09 01:19:50,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:50,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:50,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-03-09 01:19:50,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:51,045 INFO L124 PetriNetUnfolderBase]: 525/985 cut-off events. [2025-03-09 01:19:51,045 INFO L125 PetriNetUnfolderBase]: For 726/818 co-relation queries the response was YES. [2025-03-09 01:19:51,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 985 events. 525/985 cut-off events. For 726/818 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4784 event pairs, 406 based on Foata normal form. 31/935 useless extension candidates. Maximal degree in co-relation 2326. Up to 773 conditions per place. [2025-03-09 01:19:51,050 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 55 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-09 01:19:51,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 72 transitions, 422 flow [2025-03-09 01:19:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:19:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:19:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2025-03-09 01:19:51,051 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2025-03-09 01:19:51,051 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 312 flow. Second operand 4 states and 127 transitions. [2025-03-09 01:19:51,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 72 transitions, 422 flow [2025-03-09 01:19:51,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 414 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:19:51,054 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 304 flow [2025-03-09 01:19:51,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2025-03-09 01:19:51,054 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-09 01:19:51,055 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 304 flow [2025-03-09 01:19:51,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:51,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:51,055 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:51,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 01:19:51,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:51,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:51,056 INFO L85 PathProgramCache]: Analyzing trace with hash 2130030314, now seen corresponding path program 1 times [2025-03-09 01:19:51,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:51,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-03-09 01:19:51,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:51,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:51,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:19:51,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:19:51,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:51,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:51,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293276082] [2025-03-09 01:19:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293276082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:51,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321824148] [2025-03-09 01:19:51,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:51,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:51,332 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:51,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:19:51,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:19:51,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:19:51,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:51,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:51,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:19:51,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:51,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:51,591 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-09 01:19:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:51,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321824148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:51,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:51,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-09 01:19:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993550046] [2025-03-09 01:19:51,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:51,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:19:51,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:51,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:19:51,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:19:52,090 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-09 01:19:52,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 304 flow. Second operand has 25 states, 25 states have (on average 30.24) internal successors, (756), 25 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:52,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:52,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-09 01:19:52,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:52,465 INFO L124 PetriNetUnfolderBase]: 888/1668 cut-off events. [2025-03-09 01:19:52,465 INFO L125 PetriNetUnfolderBase]: For 1019/1138 co-relation queries the response was YES. [2025-03-09 01:19:52,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 1668 events. 888/1668 cut-off events. For 1019/1138 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9233 event pairs, 315 based on Foata normal form. 92/1670 useless extension candidates. Maximal degree in co-relation 3994. Up to 650 conditions per place. [2025-03-09 01:19:52,474 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 71 selfloop transitions, 19 changer transitions 0/104 dead transitions. [2025-03-09 01:19:52,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 592 flow [2025-03-09 01:19:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:19:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:19:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 366 transitions. [2025-03-09 01:19:52,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-09 01:19:52,478 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 304 flow. Second operand 10 states and 366 transitions. [2025-03-09 01:19:52,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 592 flow [2025-03-09 01:19:52,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 589 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:52,481 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 359 flow [2025-03-09 01:19:52,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=359, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2025-03-09 01:19:52,482 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2025-03-09 01:19:52,482 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 359 flow [2025-03-09 01:19:52,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 30.24) internal successors, (756), 25 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:52,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:52,483 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:52,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:19:52,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:52,683 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:52,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:52,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1105839415, now seen corresponding path program 1 times [2025-03-09 01:19:52,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:52,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816969738] [2025-03-09 01:19:52,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:52,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:19:52,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:19:52,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:52,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:19:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816969738] [2025-03-09 01:19:53,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816969738] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:53,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487132201] [2025-03-09 01:19:53,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:53,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:53,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:53,233 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:53,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:19:53,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 01:19:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 01:19:53,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:53,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:53,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-09 01:19:53,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:53,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:53,393 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:19:53,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:19:53,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:53,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:53,475 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2025-03-09 01:19:53,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-09 01:19:53,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:53,484 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-09 01:19:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:53,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:54,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-09 01:19:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:54,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487132201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:19:54,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:19:54,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 34 [2025-03-09 01:19:54,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404799699] [2025-03-09 01:19:54,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:19:54,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:19:54,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:54,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:19:54,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:19:55,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2025-03-09 01:19:55,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 359 flow. Second operand has 36 states, 36 states have (on average 20.13888888888889) internal successors, (725), 36 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:55,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:55,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2025-03-09 01:19:55,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:56,460 INFO L124 PetriNetUnfolderBase]: 3065/5319 cut-off events. [2025-03-09 01:19:56,461 INFO L125 PetriNetUnfolderBase]: For 5734/5900 co-relation queries the response was YES. [2025-03-09 01:19:56,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14259 conditions, 5319 events. 3065/5319 cut-off events. For 5734/5900 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 34305 event pairs, 541 based on Foata normal form. 216/5484 useless extension candidates. Maximal degree in co-relation 14080. Up to 1012 conditions per place. [2025-03-09 01:19:56,499 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 123 selfloop transitions, 27 changer transitions 0/161 dead transitions. [2025-03-09 01:19:56,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 161 transitions, 999 flow [2025-03-09 01:19:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:19:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 01:19:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 503 transitions. [2025-03-09 01:19:56,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4191666666666667 [2025-03-09 01:19:56,501 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 359 flow. Second operand 20 states and 503 transitions. [2025-03-09 01:19:56,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 161 transitions, 999 flow [2025-03-09 01:19:56,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 161 transitions, 966 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:19:56,508 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 464 flow [2025-03-09 01:19:56,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=464, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-03-09 01:19:56,509 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 32 predicate places. [2025-03-09 01:19:56,509 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 464 flow [2025-03-09 01:19:56,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 20.13888888888889) internal successors, (725), 36 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:56,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:56,510 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:56,517 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-09 01:19:56,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-09 01:19:56,711 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:56,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1566397821, now seen corresponding path program 1 times [2025-03-09 01:19:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:56,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493978939] [2025-03-09 01:19:56,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:56,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:56,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:19:56,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:19:56,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:56,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 24 proven. 14 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-09 01:19:57,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493978939] [2025-03-09 01:19:57,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493978939] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:57,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711502263] [2025-03-09 01:19:57,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:57,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:57,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:57,162 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:57,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:19:57,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:19:57,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:19:57,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:57,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:57,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-09 01:19:57,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:19:57,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:19:57,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:19:57,372 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:19:57,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:19:57,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:19:57,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:19:57,624 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:19:57,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2025-03-09 01:19:57,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:19:57,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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-09 01:19:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:57,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:19:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:58,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711502263] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:58,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:19:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 26 [2025-03-09 01:19:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958451011] [2025-03-09 01:19:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:19:58,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:19:58,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:19:58,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:19:58,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=586, Unknown=0, NotChecked=0, Total=756 [2025-03-09 01:19:58,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-03-09 01:19:58,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 464 flow. Second operand has 11 states, 11 states have (on average 28.272727272727273) internal successors, (311), 11 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:58,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:19:58,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-03-09 01:19:58,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:19:59,428 INFO L124 PetriNetUnfolderBase]: 4725/7971 cut-off events. [2025-03-09 01:19:59,428 INFO L125 PetriNetUnfolderBase]: For 14887/15350 co-relation queries the response was YES. [2025-03-09 01:19:59,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22899 conditions, 7971 events. 4725/7971 cut-off events. For 14887/15350 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 54398 event pairs, 2389 based on Foata normal form. 0/7628 useless extension candidates. Maximal degree in co-relation 22710. Up to 3942 conditions per place. [2025-03-09 01:19:59,467 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 85 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2025-03-09 01:19:59,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 103 transitions, 774 flow [2025-03-09 01:19:59,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:19:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 01:19:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2025-03-09 01:19:59,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5638888888888889 [2025-03-09 01:19:59,469 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 464 flow. Second operand 6 states and 203 transitions. [2025-03-09 01:19:59,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 103 transitions, 774 flow [2025-03-09 01:19:59,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 769 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:19:59,477 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 488 flow [2025-03-09 01:19:59,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=488, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2025-03-09 01:19:59,477 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 37 predicate places. [2025-03-09 01:19:59,477 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 488 flow [2025-03-09 01:19:59,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.272727272727273) internal successors, (311), 11 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:19:59,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:19:59,477 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:19:59,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:19:59,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:19:59,678 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:19:59,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:19:59,679 INFO L85 PathProgramCache]: Analyzing trace with hash 78717197, now seen corresponding path program 1 times [2025-03-09 01:19:59,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:19:59,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012532268] [2025-03-09 01:19:59,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:59,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:19:59,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:19:59,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:19:59,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:19:59,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:19:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:19:59,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:19:59,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012532268] [2025-03-09 01:19:59,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012532268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:19:59,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943990862] [2025-03-09 01:19:59,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:19:59,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:19:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:19:59,992 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:19:59,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:20:00,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 01:20:00,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 01:20:00,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:00,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:00,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:20:00,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:00,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:00,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:20:00,162 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:20:00,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-09 01:20:00,171 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:00,171 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-09 01:20:00,420 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 20 proven. 8 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:00,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:00,710 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 25 proven. 3 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943990862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:00,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-09 01:20:00,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968489748] [2025-03-09 01:20:00,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:00,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 01:20:00,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:00,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 01:20:00,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:20:01,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 60 [2025-03-09 01:20:01,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 488 flow. Second operand has 29 states, 29 states have (on average 24.06896551724138) internal successors, (698), 29 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:01,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:01,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 60 [2025-03-09 01:20:01,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:02,275 INFO L124 PetriNetUnfolderBase]: 2693/4930 cut-off events. [2025-03-09 01:20:02,275 INFO L125 PetriNetUnfolderBase]: For 9283/9579 co-relation queries the response was YES. [2025-03-09 01:20:02,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15401 conditions, 4930 events. 2693/4930 cut-off events. For 9283/9579 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 33594 event pairs, 701 based on Foata normal form. 258/5103 useless extension candidates. Maximal degree in co-relation 15207. Up to 1247 conditions per place. [2025-03-09 01:20:02,304 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 118 selfloop transitions, 22 changer transitions 0/156 dead transitions. [2025-03-09 01:20:02,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 156 transitions, 1071 flow [2025-03-09 01:20:02,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:20:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:20:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 499 transitions. [2025-03-09 01:20:02,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4892156862745098 [2025-03-09 01:20:02,307 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 488 flow. Second operand 17 states and 499 transitions. [2025-03-09 01:20:02,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 156 transitions, 1071 flow [2025-03-09 01:20:02,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 156 transitions, 1049 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:02,324 INFO L231 Difference]: Finished difference. Result has 112 places, 84 transitions, 543 flow [2025-03-09 01:20:02,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=543, PETRI_PLACES=112, PETRI_TRANSITIONS=84} [2025-03-09 01:20:02,324 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 52 predicate places. [2025-03-09 01:20:02,324 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 84 transitions, 543 flow [2025-03-09 01:20:02,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 24.06896551724138) internal successors, (698), 29 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:02,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:02,325 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:02,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:20:02,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 01:20:02,525 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:02,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:02,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1740243185, now seen corresponding path program 1 times [2025-03-09 01:20:02,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:02,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017326545] [2025-03-09 01:20:02,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:02,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:02,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:20:02,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:20:02,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:02,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:02,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:02,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017326545] [2025-03-09 01:20:02,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017326545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:02,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27088550] [2025-03-09 01:20:02,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:02,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:02,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:02,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:20:02,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:20:02,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:20:02,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:02,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:02,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:20:02,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:02,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:20:02,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:02,987 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:02,987 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-09 01:20:02,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:20:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:03,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:03,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27088550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:03,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:03,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2025-03-09 01:20:03,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442606177] [2025-03-09 01:20:03,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:03,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 01:20:03,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:03,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 01:20:03,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-03-09 01:20:04,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 01:20:04,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 84 transitions, 543 flow. Second operand has 29 states, 29 states have (on average 23.379310344827587) internal successors, (678), 29 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:04,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:04,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 01:20:04,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:05,627 INFO L124 PetriNetUnfolderBase]: 6040/10250 cut-off events. [2025-03-09 01:20:05,627 INFO L125 PetriNetUnfolderBase]: For 25486/26557 co-relation queries the response was YES. [2025-03-09 01:20:05,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32545 conditions, 10250 events. 6040/10250 cut-off events. For 25486/26557 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 71509 event pairs, 1150 based on Foata normal form. 471/10554 useless extension candidates. Maximal degree in co-relation 32335. Up to 2036 conditions per place. [2025-03-09 01:20:05,683 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 123 selfloop transitions, 23 changer transitions 0/160 dead transitions. [2025-03-09 01:20:05,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 160 transitions, 1297 flow [2025-03-09 01:20:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:20:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-09 01:20:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 478 transitions. [2025-03-09 01:20:05,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46862745098039216 [2025-03-09 01:20:05,685 INFO L175 Difference]: Start difference. First operand has 112 places, 84 transitions, 543 flow. Second operand 17 states and 478 transitions. [2025-03-09 01:20:05,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 160 transitions, 1297 flow [2025-03-09 01:20:05,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 160 transitions, 1245 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:05,707 INFO L231 Difference]: Finished difference. Result has 127 places, 86 transitions, 608 flow [2025-03-09 01:20:05,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=608, PETRI_PLACES=127, PETRI_TRANSITIONS=86} [2025-03-09 01:20:05,708 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 67 predicate places. [2025-03-09 01:20:05,708 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 86 transitions, 608 flow [2025-03-09 01:20:05,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 23.379310344827587) internal successors, (678), 29 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:05,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:05,709 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:05,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:20:05,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 01:20:05,913 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1313692907, now seen corresponding path program 1 times [2025-03-09 01:20:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:05,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222829364] [2025-03-09 01:20:05,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:05,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:20:05,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:20:05,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:05,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:06,110 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222829364] [2025-03-09 01:20:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222829364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:06,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498772934] [2025-03-09 01:20:06,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:06,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:06,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:06,113 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:06,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:20:06,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:20:06,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:20:06,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:06,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:06,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:20:06,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:06,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:06,389 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-09 01:20:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:06,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498772934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:06,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:06,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-09 01:20:06,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822709788] [2025-03-09 01:20:06,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:06,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:20:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:06,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:20:06,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:20:06,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-09 01:20:06,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 86 transitions, 608 flow. Second operand has 25 states, 25 states have (on average 30.48) internal successors, (762), 25 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:06,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:06,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-09 01:20:06,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:07,951 INFO L124 PetriNetUnfolderBase]: 6204/11437 cut-off events. [2025-03-09 01:20:07,951 INFO L125 PetriNetUnfolderBase]: For 30827/32011 co-relation queries the response was YES. [2025-03-09 01:20:07,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36398 conditions, 11437 events. 6204/11437 cut-off events. For 30827/32011 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 90735 event pairs, 2903 based on Foata normal form. 644/11626 useless extension candidates. Maximal degree in co-relation 36168. Up to 4940 conditions per place. [2025-03-09 01:20:08,020 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 89 selfloop transitions, 20 changer transitions 0/126 dead transitions. [2025-03-09 01:20:08,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 1120 flow [2025-03-09 01:20:08,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:08,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 362 transitions. [2025-03-09 01:20:08,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6033333333333334 [2025-03-09 01:20:08,021 INFO L175 Difference]: Start difference. First operand has 127 places, 86 transitions, 608 flow. Second operand 10 states and 362 transitions. [2025-03-09 01:20:08,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 126 transitions, 1120 flow [2025-03-09 01:20:08,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 126 transitions, 1056 flow, removed 6 selfloop flow, removed 14 redundant places. [2025-03-09 01:20:08,047 INFO L231 Difference]: Finished difference. Result has 124 places, 88 transitions, 624 flow [2025-03-09 01:20:08,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=624, PETRI_PLACES=124, PETRI_TRANSITIONS=88} [2025-03-09 01:20:08,047 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 64 predicate places. [2025-03-09 01:20:08,047 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 88 transitions, 624 flow [2025-03-09 01:20:08,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 30.48) internal successors, (762), 25 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:08,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:08,048 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:08,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:20:08,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 01:20:08,249 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:08,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:08,249 INFO L85 PathProgramCache]: Analyzing trace with hash -261475856, now seen corresponding path program 1 times [2025-03-09 01:20:08,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:08,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074837697] [2025-03-09 01:20:08,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:08,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:08,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:20:08,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:20:08,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:08,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 29 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-09 01:20:08,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074837697] [2025-03-09 01:20:08,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074837697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:08,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363981812] [2025-03-09 01:20:08,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:08,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:08,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:08,971 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:08,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:20:09,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:20:09,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:20:09,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:09,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:09,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 01:20:09,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:09,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:09,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:20:09,141 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:20:09,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:20:09,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:20:09,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:09,190 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-09 01:20:09,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:20:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:09,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363981812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:09,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 34 [2025-03-09 01:20:09,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634229861] [2025-03-09 01:20:09,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:09,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:20:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:09,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:20:09,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=941, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:20:10,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2025-03-09 01:20:10,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 88 transitions, 624 flow. Second operand has 36 states, 36 states have (on average 20.47222222222222) internal successors, (737), 36 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:10,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:10,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2025-03-09 01:20:10,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:14,239 INFO L124 PetriNetUnfolderBase]: 17343/29246 cut-off events. [2025-03-09 01:20:14,239 INFO L125 PetriNetUnfolderBase]: For 81017/83389 co-relation queries the response was YES. [2025-03-09 01:20:14,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97951 conditions, 29246 events. 17343/29246 cut-off events. For 81017/83389 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 234699 event pairs, 4073 based on Foata normal form. 1296/30489 useless extension candidates. Maximal degree in co-relation 97719. Up to 6780 conditions per place. [2025-03-09 01:20:14,453 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 164 selfloop transitions, 24 changer transitions 0/200 dead transitions. [2025-03-09 01:20:14,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 200 transitions, 1782 flow [2025-03-09 01:20:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-09 01:20:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-09 01:20:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 453 transitions. [2025-03-09 01:20:14,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2025-03-09 01:20:14,455 INFO L175 Difference]: Start difference. First operand has 124 places, 88 transitions, 624 flow. Second operand 18 states and 453 transitions. [2025-03-09 01:20:14,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 200 transitions, 1782 flow [2025-03-09 01:20:14,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 200 transitions, 1749 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:14,524 INFO L231 Difference]: Finished difference. Result has 139 places, 91 transitions, 677 flow [2025-03-09 01:20:14,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=677, PETRI_PLACES=139, PETRI_TRANSITIONS=91} [2025-03-09 01:20:14,525 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 79 predicate places. [2025-03-09 01:20:14,525 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 91 transitions, 677 flow [2025-03-09 01:20:14,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 20.47222222222222) internal successors, (737), 36 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:14,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:14,526 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:14,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 01:20:14,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 01:20:14,726 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:14,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:14,727 INFO L85 PathProgramCache]: Analyzing trace with hash -112368342, now seen corresponding path program 1 times [2025-03-09 01:20:14,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:14,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283551124] [2025-03-09 01:20:14,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:14,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:14,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:20:14,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:20:14,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:14,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:15,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:15,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283551124] [2025-03-09 01:20:15,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283551124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:15,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056322619] [2025-03-09 01:20:15,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:15,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:15,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:15,166 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-09 01:20:15,167 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-09 01:20:15,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-09 01:20:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-09 01:20:15,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:15,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:15,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:20:15,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:15,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:15,541 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-09 01:20:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:15,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056322619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:15,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:15,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-09 01:20:15,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763330938] [2025-03-09 01:20:15,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:15,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:20:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:15,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:20:15,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:20:16,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-09 01:20:16,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 91 transitions, 677 flow. Second operand has 32 states, 32 states have (on average 29.96875) internal successors, (959), 32 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:16,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:16,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-09 01:20:16,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:19,065 INFO L124 PetriNetUnfolderBase]: 10983/21059 cut-off events. [2025-03-09 01:20:19,066 INFO L125 PetriNetUnfolderBase]: For 70851/72782 co-relation queries the response was YES. [2025-03-09 01:20:19,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75448 conditions, 21059 events. 10983/21059 cut-off events. For 70851/72782 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 182332 event pairs, 2437 based on Foata normal form. 957/21613 useless extension candidates. Maximal degree in co-relation 75212. Up to 4518 conditions per place. [2025-03-09 01:20:19,351 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 162 selfloop transitions, 23 changer transitions 0/203 dead transitions. [2025-03-09 01:20:19,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 203 transitions, 1850 flow [2025-03-09 01:20:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:20:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:20:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 496 transitions. [2025-03-09 01:20:19,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6358974358974359 [2025-03-09 01:20:19,353 INFO L175 Difference]: Start difference. First operand has 139 places, 91 transitions, 677 flow. Second operand 13 states and 496 transitions. [2025-03-09 01:20:19,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 203 transitions, 1850 flow [2025-03-09 01:20:19,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 203 transitions, 1744 flow, removed 18 selfloop flow, removed 14 redundant places. [2025-03-09 01:20:19,468 INFO L231 Difference]: Finished difference. Result has 140 places, 93 transitions, 709 flow [2025-03-09 01:20:19,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=709, PETRI_PLACES=140, PETRI_TRANSITIONS=93} [2025-03-09 01:20:19,469 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 80 predicate places. [2025-03-09 01:20:19,469 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 93 transitions, 709 flow [2025-03-09 01:20:19,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 29.96875) internal successors, (959), 32 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:19,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:19,470 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:19,476 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-09 01:20:19,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:19,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:19,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:19,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1819245003, now seen corresponding path program 1 times [2025-03-09 01:20:19,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:19,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263761140] [2025-03-09 01:20:19,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:19,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:20:19,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:20:19,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:19,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263761140] [2025-03-09 01:20:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263761140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146229664] [2025-03-09 01:20:19,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:19,986 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-09 01:20:19,989 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-09 01:20:20,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 01:20:20,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 01:20:20,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:20,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:20,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:20:20,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:20,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:20,368 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-09 01:20:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146229664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:20,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:20,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-09 01:20:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205728563] [2025-03-09 01:20:20,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:20,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:20:20,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:20,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:20:20,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=806, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:20:21,196 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 60 [2025-03-09 01:20:21,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 93 transitions, 709 flow. Second operand has 32 states, 32 states have (on average 30.15625) internal successors, (965), 32 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:21,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:21,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 60 [2025-03-09 01:20:21,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:23,928 INFO L124 PetriNetUnfolderBase]: 12849/24473 cut-off events. [2025-03-09 01:20:23,929 INFO L125 PetriNetUnfolderBase]: For 91567/93799 co-relation queries the response was YES. [2025-03-09 01:20:24,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88868 conditions, 24473 events. 12849/24473 cut-off events. For 91567/93799 co-relation queries the response was YES. Maximal size of possible extension queue 724. Compared 215156 event pairs, 3452 based on Foata normal form. 1143/25339 useless extension candidates. Maximal degree in co-relation 88629. Up to 5988 conditions per place. [2025-03-09 01:20:24,166 INFO L140 encePairwiseOnDemand]: 50/60 looper letters, 158 selfloop transitions, 23 changer transitions 0/199 dead transitions. [2025-03-09 01:20:24,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 199 transitions, 1929 flow [2025-03-09 01:20:24,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:20:24,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:20:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 486 transitions. [2025-03-09 01:20:24,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6230769230769231 [2025-03-09 01:20:24,167 INFO L175 Difference]: Start difference. First operand has 140 places, 93 transitions, 709 flow. Second operand 13 states and 486 transitions. [2025-03-09 01:20:24,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 199 transitions, 1929 flow [2025-03-09 01:20:24,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 199 transitions, 1860 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-09 01:20:24,291 INFO L231 Difference]: Finished difference. Result has 146 places, 94 transitions, 738 flow [2025-03-09 01:20:24,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=738, PETRI_PLACES=146, PETRI_TRANSITIONS=94} [2025-03-09 01:20:24,292 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 86 predicate places. [2025-03-09 01:20:24,292 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 94 transitions, 738 flow [2025-03-09 01:20:24,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 30.15625) internal successors, (965), 32 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:24,292 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:24,299 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-09 01:20:24,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:24,493 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:24,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:24,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1574146062, now seen corresponding path program 2 times [2025-03-09 01:20:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:24,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91999710] [2025-03-09 01:20:24,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:24,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:24,502 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:20:24,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:20:24,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:24,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:24,828 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-09 01:20:24,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:24,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91999710] [2025-03-09 01:20:24,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91999710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:24,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151462087] [2025-03-09 01:20:24,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:24,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:24,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:24,830 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-09 01:20:24,832 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-09 01:20:24,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 50 statements into 2 equivalence classes. [2025-03-09 01:20:24,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-03-09 01:20:24,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:24,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:24,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-09 01:20:24,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:24,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20: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 8 treesize of output 1 [2025-03-09 01:20:25,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:25,078 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-09 01:20:25,088 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:20:25,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:20:25,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:25,145 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-09 01:20:25,151 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:25,152 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-09 01:20:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 20 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:25,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:26,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151462087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:26,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:26,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 14] total 36 [2025-03-09 01:20:26,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141905071] [2025-03-09 01:20:26,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:26,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-09 01:20:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:26,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-09 01:20:26,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2025-03-09 01:20:27,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2025-03-09 01:20:27,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 94 transitions, 738 flow. Second operand has 38 states, 38 states have (on average 19.44736842105263) internal successors, (739), 38 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:27,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:27,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2025-03-09 01:20:27,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:33,987 INFO L124 PetriNetUnfolderBase]: 35878/53076 cut-off events. [2025-03-09 01:20:33,987 INFO L125 PetriNetUnfolderBase]: For 228699/232935 co-relation queries the response was YES. [2025-03-09 01:20:34,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211214 conditions, 53076 events. 35878/53076 cut-off events. For 228699/232935 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 383781 event pairs, 702 based on Foata normal form. 1044/50927 useless extension candidates. Maximal degree in co-relation 210972. Up to 8285 conditions per place. [2025-03-09 01:20:34,635 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 259 selfloop transitions, 25 changer transitions 0/295 dead transitions. [2025-03-09 01:20:34,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 295 transitions, 2786 flow [2025-03-09 01:20:34,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:20:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-09 01:20:34,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 522 transitions. [2025-03-09 01:20:34,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.435 [2025-03-09 01:20:34,636 INFO L175 Difference]: Start difference. First operand has 146 places, 94 transitions, 738 flow. Second operand 20 states and 522 transitions. [2025-03-09 01:20:34,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 295 transitions, 2786 flow [2025-03-09 01:20:34,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 295 transitions, 2650 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-03-09 01:20:34,979 INFO L231 Difference]: Finished difference. Result has 150 places, 95 transitions, 736 flow [2025-03-09 01:20:34,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=736, PETRI_PLACES=150, PETRI_TRANSITIONS=95} [2025-03-09 01:20:34,979 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 90 predicate places. [2025-03-09 01:20:34,979 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 95 transitions, 736 flow [2025-03-09 01:20:34,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 19.44736842105263) internal successors, (739), 38 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:34,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:34,980 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:34,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 01:20:35,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:35,180 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:35,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:35,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1699715364, now seen corresponding path program 1 times [2025-03-09 01:20:35,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:35,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462648133] [2025-03-09 01:20:35,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:35,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:35,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 01:20:35,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 01:20:35,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:35,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-09 01:20:35,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462648133] [2025-03-09 01:20:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462648133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:35,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:35,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:20:35,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472329906] [2025-03-09 01:20:35,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:35,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:35,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:35,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:35,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:35,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-09 01:20:35,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 95 transitions, 736 flow. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:35,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:35,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-09 01:20:35,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:38,670 INFO L124 PetriNetUnfolderBase]: 14188/26759 cut-off events. [2025-03-09 01:20:38,670 INFO L125 PetriNetUnfolderBase]: For 111133/114796 co-relation queries the response was YES. [2025-03-09 01:20:38,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98438 conditions, 26759 events. 14188/26759 cut-off events. For 111133/114796 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 236837 event pairs, 10966 based on Foata normal form. 36/26231 useless extension candidates. Maximal degree in co-relation 98199. Up to 17850 conditions per place. [2025-03-09 01:20:38,901 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 94 selfloop transitions, 2 changer transitions 1/116 dead transitions. [2025-03-09 01:20:38,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 116 transitions, 1106 flow [2025-03-09 01:20:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:38,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2025-03-09 01:20:38,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-03-09 01:20:38,903 INFO L175 Difference]: Start difference. First operand has 150 places, 95 transitions, 736 flow. Second operand 3 states and 129 transitions. [2025-03-09 01:20:38,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 116 transitions, 1106 flow [2025-03-09 01:20:39,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 116 transitions, 1054 flow, removed 0 selfloop flow, removed 16 redundant places. [2025-03-09 01:20:39,126 INFO L231 Difference]: Finished difference. Result has 137 places, 95 transitions, 701 flow [2025-03-09 01:20:39,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=137, PETRI_TRANSITIONS=95} [2025-03-09 01:20:39,127 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 77 predicate places. [2025-03-09 01:20:39,127 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 95 transitions, 701 flow [2025-03-09 01:20:39,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:39,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:39,127 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:39,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 01:20:39,127 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:39,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1553886972, now seen corresponding path program 2 times [2025-03-09 01:20:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224273991] [2025-03-09 01:20:39,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:39,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:20:39,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-09 01:20:39,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-09 01:20:39,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224273991] [2025-03-09 01:20:39,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224273991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:39,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133233722] [2025-03-09 01:20:39,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:39,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:39,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:39,273 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-09 01:20:39,278 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-09 01:20:39,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 51 statements into 2 equivalence classes. [2025-03-09 01:20:39,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 51 statements. [2025-03-09 01:20:39,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:39,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:39,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 01:20:39,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:39,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:39,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:39,578 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:20:39,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:20:39,592 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 01:20:39,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-09 01:20:39,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:39,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:39,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-03-09 01:20:39,713 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-09 01:20:39,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-09 01:20:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-09 01:20:40,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-09 01:20:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133233722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:40,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:40,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2025-03-09 01:20:40,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928511339] [2025-03-09 01:20:40,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:40,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:40,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:40,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:40,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:41,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-03-09 01:20:41,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 95 transitions, 701 flow. Second operand has 14 states, 14 states have (on average 24.642857142857142) internal successors, (345), 14 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:41,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:41,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-03-09 01:20:41,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:46,010 INFO L124 PetriNetUnfolderBase]: 24976/37063 cut-off events. [2025-03-09 01:20:46,010 INFO L125 PetriNetUnfolderBase]: For 142857/145925 co-relation queries the response was YES. [2025-03-09 01:20:46,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145656 conditions, 37063 events. 24976/37063 cut-off events. For 142857/145925 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 262087 event pairs, 10850 based on Foata normal form. 732/37159 useless extension candidates. Maximal degree in co-relation 145432. Up to 17562 conditions per place. [2025-03-09 01:20:46,352 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 113 selfloop transitions, 16 changer transitions 0/142 dead transitions. [2025-03-09 01:20:46,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 142 transitions, 1316 flow [2025-03-09 01:20:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 229 transitions. [2025-03-09 01:20:46,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47708333333333336 [2025-03-09 01:20:46,353 INFO L175 Difference]: Start difference. First operand has 137 places, 95 transitions, 701 flow. Second operand 8 states and 229 transitions. [2025-03-09 01:20:46,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 142 transitions, 1316 flow [2025-03-09 01:20:46,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 142 transitions, 1288 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:46,497 INFO L231 Difference]: Finished difference. Result has 138 places, 95 transitions, 719 flow [2025-03-09 01:20:46,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=719, PETRI_PLACES=138, PETRI_TRANSITIONS=95} [2025-03-09 01:20:46,497 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 78 predicate places. [2025-03-09 01:20:46,497 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 95 transitions, 719 flow [2025-03-09 01:20:46,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.642857142857142) internal successors, (345), 14 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:46,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:46,497 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:46,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:20:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,698 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:46,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1663609355, now seen corresponding path program 2 times [2025-03-09 01:20:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092232215] [2025-03-09 01:20:46,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:46,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-09 01:20:46,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:20:46,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:46,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-09 01:20:46,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:46,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092232215] [2025-03-09 01:20:46,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092232215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:46,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476235836] [2025-03-09 01:20:46,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:46,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:46,966 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-09 01:20:46,968 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-09 01:20:47,063 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-09 01:20:47,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 01:20:47,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:47,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:47,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-09 01:20:47,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:47,217 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:20:47,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:20:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:47,424 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:47,783 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-09 01:20:47,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476235836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:47,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:47,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 13] total 34 [2025-03-09 01:20:47,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740047952] [2025-03-09 01:20:47,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:47,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-09 01:20:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:47,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-09 01:20:47,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2025-03-09 01:20:48,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 60 [2025-03-09 01:20:48,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 95 transitions, 719 flow. Second operand has 35 states, 35 states have (on average 22.685714285714287) internal successors, (794), 35 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:48,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:48,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 60 [2025-03-09 01:20:48,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:53,940 INFO L124 PetriNetUnfolderBase]: 26824/39644 cut-off events. [2025-03-09 01:20:53,940 INFO L125 PetriNetUnfolderBase]: For 176024/181023 co-relation queries the response was YES. [2025-03-09 01:20:54,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148665 conditions, 39644 events. 26824/39644 cut-off events. For 176024/181023 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 274501 event pairs, 576 based on Foata normal form. 884/37516 useless extension candidates. Maximal degree in co-relation 148440. Up to 6202 conditions per place. [2025-03-09 01:20:54,394 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 220 selfloop transitions, 28 changer transitions 0/262 dead transitions. [2025-03-09 01:20:54,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 262 transitions, 2453 flow [2025-03-09 01:20:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 01:20:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-09 01:20:54,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 608 transitions. [2025-03-09 01:20:54,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2025-03-09 01:20:54,395 INFO L175 Difference]: Start difference. First operand has 138 places, 95 transitions, 719 flow. Second operand 22 states and 608 transitions. [2025-03-09 01:20:54,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 262 transitions, 2453 flow [2025-03-09 01:20:54,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 262 transitions, 2303 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-09 01:20:54,647 INFO L231 Difference]: Finished difference. Result has 149 places, 95 transitions, 724 flow [2025-03-09 01:20:54,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=724, PETRI_PLACES=149, PETRI_TRANSITIONS=95} [2025-03-09 01:20:54,647 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 89 predicate places. [2025-03-09 01:20:54,647 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 95 transitions, 724 flow [2025-03-09 01:20:54,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 22.685714285714287) internal successors, (794), 35 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:54,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:54,648 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:54,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:54,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:54,849 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:54,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1947442643, now seen corresponding path program 1 times [2025-03-09 01:20:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394438283] [2025-03-09 01:20:54,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:54,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:54,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 01:20:54,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 01:20:54,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:54,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-09 01:20:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394438283] [2025-03-09 01:20:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394438283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:54,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:54,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:20:54,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948637702] [2025-03-09 01:20:54,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:54,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:54,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:54,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:54,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:54,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-09 01:20:54,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 95 transitions, 724 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:54,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:54,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-09 01:20:54,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:58,306 INFO L124 PetriNetUnfolderBase]: 14147/23080 cut-off events. [2025-03-09 01:20:58,306 INFO L125 PetriNetUnfolderBase]: For 101753/103954 co-relation queries the response was YES. [2025-03-09 01:20:58,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82872 conditions, 23080 events. 14147/23080 cut-off events. For 101753/103954 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 177245 event pairs, 10850 based on Foata normal form. 41/21576 useless extension candidates. Maximal degree in co-relation 82635. Up to 17605 conditions per place. [2025-03-09 01:20:58,483 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 119 selfloop transitions, 3 changer transitions 0/141 dead transitions. [2025-03-09 01:20:58,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 141 transitions, 1314 flow [2025-03-09 01:20:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-03-09 01:20:58,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7208333333333333 [2025-03-09 01:20:58,484 INFO L175 Difference]: Start difference. First operand has 149 places, 95 transitions, 724 flow. Second operand 4 states and 173 transitions. [2025-03-09 01:20:58,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 141 transitions, 1314 flow [2025-03-09 01:20:58,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 141 transitions, 1237 flow, removed 3 selfloop flow, removed 18 redundant places. [2025-03-09 01:20:58,551 INFO L231 Difference]: Finished difference. Result has 136 places, 96 transitions, 690 flow [2025-03-09 01:20:58,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=690, PETRI_PLACES=136, PETRI_TRANSITIONS=96} [2025-03-09 01:20:58,552 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 76 predicate places. [2025-03-09 01:20:58,552 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 96 transitions, 690 flow [2025-03-09 01:20:58,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:58,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:58,553 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:58,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-09 01:20:58,553 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-03-09 01:20:58,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -604108263, now seen corresponding path program 2 times [2025-03-09 01:20:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677862190] [2025-03-09 01:20:58,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:58,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:58,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-09 01:20:58,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 54 statements. [2025-03-09 01:20:58,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:58,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-09 01:20:58,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:58,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677862190] [2025-03-09 01:20:58,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677862190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:58,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:20:58,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623878391] [2025-03-09 01:20:58,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:58,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:58,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:58,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:58,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:58,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 60 [2025-03-09 01:20:58,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 96 transitions, 690 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:58,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:58,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 60 [2025-03-09 01:20:58,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand