./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-more-array-sum.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 e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:12:51,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:12:51,494 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:12:51,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:12:51,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:12:51,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:12:51,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:12:51,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:12:51,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:12:51,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:12:51,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:12:51,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:12:51,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:12:51,515 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:12:51,516 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:12:51,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:12:51,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:51,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:12:51,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:12:51,517 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 -> e4a4a131c0d4df2db1bf018027395318bc112945cbb20d5c862562c48934e5a1 [2025-03-04 10:12:51,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:12:51,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:12:51,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:12:51,799 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:12:51,799 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:12:51,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-04 10:12:53,082 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c87ed2a2/c91ccbb502284cbda31376930ab43a7c/FLAG896d5e712 [2025-03-04 10:12:53,353 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:12:53,354 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum.wvr.c [2025-03-04 10:12:53,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c87ed2a2/c91ccbb502284cbda31376930ab43a7c/FLAG896d5e712 [2025-03-04 10:12:53,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c87ed2a2/c91ccbb502284cbda31376930ab43a7c [2025-03-04 10:12:53,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:12:53,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:12:53,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:53,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:12:53,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:12:53,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bcbc386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53, skipping insertion in model container [2025-03-04 10:12:53,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:12:53,557 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-04 10:12:53,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:53,574 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:12:53,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:12:53,620 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:12:53,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53 WrapperNode [2025-03-04 10:12:53,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:12:53,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:53,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:12:53,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:12:53,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,658 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 251 [2025-03-04 10:12:53,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:12:53,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:12:53,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:12:53,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:12:53,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,692 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-04 10:12:53,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:12:53,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:12:53,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:12:53,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:12:53,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (1/1) ... [2025-03-04 10:12:53,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:12:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:53,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:12:53,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:12:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:12:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 10:12:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 10:12:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 10:12:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 10:12:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 10:12:53,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 10:12:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:12:53,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:12:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:12:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:12:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:12:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:12:53,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:12:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:12:53,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:12:53,770 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 10:12:53,867 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:12:53,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:12:54,265 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:12:54,265 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:12:54,512 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:12:54,512 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:12:54,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:54 BoogieIcfgContainer [2025-03-04 10:12:54,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:12:54,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:12:54,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:12:54,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:12:54,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:12:53" (1/3) ... [2025-03-04 10:12:54,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b40ddf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:54, skipping insertion in model container [2025-03-04 10:12:54,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:12:53" (2/3) ... [2025-03-04 10:12:54,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b40ddf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:12:54, skipping insertion in model container [2025-03-04 10:12:54,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:12:54" (3/3) ... [2025-03-04 10:12:54,519 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2025-03-04 10:12:54,532 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:12:54,533 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum.wvr.c that has 4 procedures, 55 locations, 1 initial locations, 5 loop locations, and 18 error locations. [2025-03-04 10:12:54,534 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:12:54,587 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 10:12:54,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 59 transitions, 139 flow [2025-03-04 10:12:54,634 INFO L124 PetriNetUnfolderBase]: 5/56 cut-off events. [2025-03-04 10:12:54,635 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 10:12:54,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 56 events. 5/56 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 146 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-03-04 10:12:54,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 59 transitions, 139 flow [2025-03-04 10:12:54,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 55 transitions, 128 flow [2025-03-04 10:12:54,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:12:54,656 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;@49107cd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:12:54,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-04 10:12:54,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:12:54,661 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-04 10:12:54,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:12:54,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:54,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:12:54,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:54,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash 788375, now seen corresponding path program 1 times [2025-03-04 10:12:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:54,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708037430] [2025-03-04 10:12:54,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:54,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:54,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:12:54,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:12:54,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:54,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:54,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:54,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708037430] [2025-03-04 10:12:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708037430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:54,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:54,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:12:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178521227] [2025-03-04 10:12:54,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:54,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:12:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:54,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:12:54,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:12:54,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:12:54,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:54,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:54,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:12:54,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:55,129 INFO L124 PetriNetUnfolderBase]: 499/893 cut-off events. [2025-03-04 10:12:55,129 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-04 10:12:55,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1689 conditions, 893 events. 499/893 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4331 event pairs, 358 based on Foata normal form. 1/790 useless extension candidates. Maximal degree in co-relation 1458. Up to 717 conditions per place. [2025-03-04 10:12:55,142 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 28 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2025-03-04 10:12:55,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 180 flow [2025-03-04 10:12:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:12:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:12:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2025-03-04 10:12:55,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101694915254238 [2025-03-04 10:12:55,154 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 128 flow. Second operand 3 states and 108 transitions. [2025-03-04 10:12:55,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 180 flow [2025-03-04 10:12:55,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 168 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:12:55,161 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 112 flow [2025-03-04 10:12:55,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=52, PETRI_TRANSITIONS=51} [2025-03-04 10:12:55,167 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2025-03-04 10:12:55,167 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 112 flow [2025-03-04 10:12:55,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:55,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:55,168 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 10:12:55,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:12:55,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:55,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:55,170 INFO L85 PathProgramCache]: Analyzing trace with hash 788376, now seen corresponding path program 1 times [2025-03-04 10:12:55,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:55,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585015301] [2025-03-04 10:12:55,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:55,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:55,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:12:55,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:12:55,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:55,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:55,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:55,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:55,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585015301] [2025-03-04 10:12:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585015301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:55,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:55,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:12:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168527363] [2025-03-04 10:12:55,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:55,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:12:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:55,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:12:55,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:12:55,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:12:55,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:55,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:55,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:12:55,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:55,583 INFO L124 PetriNetUnfolderBase]: 500/896 cut-off events. [2025-03-04 10:12:55,584 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 10:12:55,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 896 events. 500/896 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4347 event pairs, 358 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1618. Up to 726 conditions per place. [2025-03-04 10:12:55,589 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 31 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2025-03-04 10:12:55,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 54 transitions, 188 flow [2025-03-04 10:12:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:12:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:12:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 10:12:55,591 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-03-04 10:12:55,591 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 112 flow. Second operand 4 states and 136 transitions. [2025-03-04 10:12:55,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 54 transitions, 188 flow [2025-03-04 10:12:55,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:55,593 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 135 flow [2025-03-04 10:12:55,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2025-03-04 10:12:55,594 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-03-04 10:12:55,594 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 135 flow [2025-03-04 10:12:55,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:55,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:55,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:12:55,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:12:55,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:55,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:55,595 INFO L85 PathProgramCache]: Analyzing trace with hash 24442174, now seen corresponding path program 1 times [2025-03-04 10:12:55,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:55,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067773448] [2025-03-04 10:12:55,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:55,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:55,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:12:55,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:12:55,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:55,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:55,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067773448] [2025-03-04 10:12:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067773448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:12:55,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:12:55,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:12:55,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536255972] [2025-03-04 10:12:55,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:12:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:55,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:12:55,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:12:55,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-04 10:12:55,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:55,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:55,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-04 10:12:55,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:55,882 INFO L124 PetriNetUnfolderBase]: 499/899 cut-off events. [2025-03-04 10:12:55,882 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 10:12:55,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 899 events. 499/899 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4343 event pairs, 358 based on Foata normal form. 1/796 useless extension candidates. Maximal degree in co-relation 1641. Up to 723 conditions per place. [2025-03-04 10:12:55,888 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 30 selfloop transitions, 4 changer transitions 1/56 dead transitions. [2025-03-04 10:12:55,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 209 flow [2025-03-04 10:12:55,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:12:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:12:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-03-04 10:12:55,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6186440677966102 [2025-03-04 10:12:55,891 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 135 flow. Second operand 4 states and 146 transitions. [2025-03-04 10:12:55,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 209 flow [2025-03-04 10:12:55,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:12:55,892 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 150 flow [2025-03-04 10:12:55,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-03-04 10:12:55,892 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2025-03-04 10:12:55,892 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 150 flow [2025-03-04 10:12:55,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:55,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:55,893 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-04 10:12:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:12:55,893 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 757653717, now seen corresponding path program 1 times [2025-03-04 10:12:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:55,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399511766] [2025-03-04 10:12:55,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:55,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:55,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:12:55,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:12:55,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:55,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:56,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399511766] [2025-03-04 10:12:56,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399511766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:56,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493439261] [2025-03-04 10:12:56,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:56,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:56,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:56,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:56,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:12:56,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 10:12:56,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 10:12:56,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:56,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:56,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 10:12:56,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:56,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2025-03-04 10:12:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:56,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:56,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493439261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:56,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:56,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-04 10:12:56,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130050387] [2025-03-04 10:12:56,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:56,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:12:56,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:56,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:12:56,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:12:56,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:12:56,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 150 flow. Second operand has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:56,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:56,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:12:56,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:56,985 INFO L124 PetriNetUnfolderBase]: 500/900 cut-off events. [2025-03-04 10:12:56,986 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 10:12:56,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 900 events. 500/900 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4345 event pairs, 358 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1646. Up to 725 conditions per place. [2025-03-04 10:12:56,992 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 28 selfloop transitions, 9 changer transitions 0/56 dead transitions. [2025-03-04 10:12:56,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 235 flow [2025-03-04 10:12:56,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:12:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:12:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2025-03-04 10:12:56,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5042372881355932 [2025-03-04 10:12:56,996 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 150 flow. Second operand 8 states and 238 transitions. [2025-03-04 10:12:56,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 235 flow [2025-03-04 10:12:56,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 56 transitions, 226 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 10:12:56,999 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 170 flow [2025-03-04 10:12:57,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=170, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2025-03-04 10:12:57,000 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2025-03-04 10:12:57,001 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 170 flow [2025-03-04 10:12:57,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 26.363636363636363) internal successors, (290), 11 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:57,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:57,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:12:57,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:12:57,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:57,206 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:57,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2012431265, now seen corresponding path program 1 times [2025-03-04 10:12:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531860495] [2025-03-04 10:12:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:57,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:12:57,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:12:57,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:57,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:57,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:57,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531860495] [2025-03-04 10:12:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531860495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:57,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464598755] [2025-03-04 10:12:57,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:57,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:57,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:57,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:57,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:12:57,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:12:57,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:12:57,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:57,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:12:57,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:57,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:12:57,572 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:12:57,572 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 32 treesize of output 27 [2025-03-04 10:12:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:57,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:57,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464598755] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:57,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:12:57,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 10 [2025-03-04 10:12:57,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293586959] [2025-03-04 10:12:57,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:12:57,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:12:57,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:57,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:12:57,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:12:57,698 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:12:57,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:57,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:57,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:12:57,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:57,831 INFO L124 PetriNetUnfolderBase]: 500/899 cut-off events. [2025-03-04 10:12:57,831 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 10:12:57,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 899 events. 500/899 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4313 event pairs, 358 based on Foata normal form. 1/798 useless extension candidates. Maximal degree in co-relation 1642. Up to 725 conditions per place. [2025-03-04 10:12:57,837 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 33 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-03-04 10:12:57,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 248 flow [2025-03-04 10:12:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:12:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:12:57,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2025-03-04 10:12:57,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5457627118644067 [2025-03-04 10:12:57,839 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 170 flow. Second operand 5 states and 161 transitions. [2025-03-04 10:12:57,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 248 flow [2025-03-04 10:12:57,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 210 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 10:12:57,841 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 147 flow [2025-03-04 10:12:57,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2025-03-04 10:12:57,841 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2025-03-04 10:12:57,841 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 147 flow [2025-03-04 10:12:57,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:57,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:57,842 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:12:57,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:12:58,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:58,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:58,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:58,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1211187551, now seen corresponding path program 1 times [2025-03-04 10:12:58,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:58,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568152374] [2025-03-04 10:12:58,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:58,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:12:58,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:12:58,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:58,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568152374] [2025-03-04 10:12:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568152374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98374076] [2025-03-04 10:12:58,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:12:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:58,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:58,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:58,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:12:58,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:12:58,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:12:58,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:12:58,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:58,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:12:58,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:58,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:58,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:12:58,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98374076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:58,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:58,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:12:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53236391] [2025-03-04 10:12:58,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:58,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:12:58,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:58,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:12:58,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:12:58,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-04 10:12:58,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 147 flow. Second operand has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:58,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:58,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-04 10:12:58,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:12:58,626 INFO L124 PetriNetUnfolderBase]: 997/1790 cut-off events. [2025-03-04 10:12:58,627 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-04 10:12:58,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3304 conditions, 1790 events. 997/1790 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9881 event pairs, 716 based on Foata normal form. 1/1591 useless extension candidates. Maximal degree in co-relation 1638. Up to 721 conditions per place. [2025-03-04 10:12:58,637 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 52 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2025-03-04 10:12:58,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 86 transitions, 356 flow [2025-03-04 10:12:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:12:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:12:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 283 transitions. [2025-03-04 10:12:58,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5995762711864406 [2025-03-04 10:12:58,639 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 147 flow. Second operand 8 states and 283 transitions. [2025-03-04 10:12:58,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 86 transitions, 356 flow [2025-03-04 10:12:58,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 342 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:12:58,641 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 198 flow [2025-03-04 10:12:58,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2025-03-04 10:12:58,641 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2025-03-04 10:12:58,641 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 198 flow [2025-03-04 10:12:58,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 28.53846153846154) internal successors, (371), 13 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:58,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:12:58,643 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:12:58,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 10:12:58,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:58,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:12:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:12:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1605654974, now seen corresponding path program 2 times [2025-03-04 10:12:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:12:58,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245380465] [2025-03-04 10:12:58,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:12:58,853 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:12:58,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:12:58,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:58,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:12:59,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:12:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245380465] [2025-03-04 10:12:59,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245380465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:12:59,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491561088] [2025-03-04 10:12:59,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:12:59,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:12:59,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:12:59,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:12:59,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:12:59,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-04 10:12:59,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:12:59,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:12:59,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:12:59,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:12:59,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:12:59,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:12:59,234 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:12:59,235 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 32 treesize of output 27 [2025-03-04 10:12:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:59,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:12:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:12:59,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491561088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:12:59,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:12:59,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-03-04 10:12:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743548945] [2025-03-04 10:12:59,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:12:59,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:12:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:12:59,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:12:59,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:12:59,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:12:59,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 198 flow. Second operand has 16 states, 16 states have (on average 26.75) internal successors, (428), 16 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:12:59,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:12:59,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:12:59,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:00,450 INFO L124 PetriNetUnfolderBase]: 1493/2672 cut-off events. [2025-03-04 10:13:00,451 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-04 10:13:00,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4938 conditions, 2672 events. 1493/2672 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 16205 event pairs, 1074 based on Foata normal form. 2/2376 useless extension candidates. Maximal degree in co-relation 3260. Up to 1432 conditions per place. [2025-03-04 10:13:00,464 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 48 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2025-03-04 10:13:00,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 85 transitions, 390 flow [2025-03-04 10:13:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:13:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 10:13:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 343 transitions. [2025-03-04 10:13:00,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5285053929121726 [2025-03-04 10:13:00,468 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 198 flow. Second operand 11 states and 343 transitions. [2025-03-04 10:13:00,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 85 transitions, 390 flow [2025-03-04 10:13:00,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 85 transitions, 370 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:00,470 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 222 flow [2025-03-04 10:13:00,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=222, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2025-03-04 10:13:00,472 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2025-03-04 10:13:00,473 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 222 flow [2025-03-04 10:13:00,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 26.75) internal successors, (428), 16 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:00,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:00,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:00,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:00,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:00,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:00,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:00,675 INFO L85 PathProgramCache]: Analyzing trace with hash 471620304, now seen corresponding path program 1 times [2025-03-04 10:13:00,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:00,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037132845] [2025-03-04 10:13:00,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:00,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:00,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:00,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:00,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:00,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037132845] [2025-03-04 10:13:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037132845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:00,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014116400] [2025-03-04 10:13:00,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:00,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:00,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:00,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:13:00,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 59 [2025-03-04 10:13:00,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:00,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:00,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 59 [2025-03-04 10:13:00,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:01,075 INFO L124 PetriNetUnfolderBase]: 2711/4340 cut-off events. [2025-03-04 10:13:01,075 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-03-04 10:13:01,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8376 conditions, 4340 events. 2711/4340 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25372 event pairs, 2100 based on Foata normal form. 0/4188 useless extension candidates. Maximal degree in co-relation 2777. Up to 3876 conditions per place. [2025-03-04 10:13:01,093 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 39 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2025-03-04 10:13:01,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 58 transitions, 306 flow [2025-03-04 10:13:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-04 10:13:01,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4440677966101695 [2025-03-04 10:13:01,094 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 222 flow. Second operand 5 states and 131 transitions. [2025-03-04 10:13:01,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 58 transitions, 306 flow [2025-03-04 10:13:01,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 58 transitions, 268 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-04 10:13:01,096 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 190 flow [2025-03-04 10:13:01,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2025-03-04 10:13:01,096 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2025-03-04 10:13:01,096 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 190 flow [2025-03-04 10:13:01,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:01,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:01,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:01,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:13:01,097 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 471620305, now seen corresponding path program 1 times [2025-03-04 10:13:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536185407] [2025-03-04 10:13:01,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:01,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:01,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:01,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:01,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:01,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536185407] [2025-03-04 10:13:01,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536185407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:01,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931302470] [2025-03-04 10:13:01,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:01,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:01,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:01,239 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:01,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:13:01,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:13:01,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:13:01,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:01,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:01,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:13:01,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:01,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:01,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:13:01,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:01,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:01,357 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 31 treesize of output 24 [2025-03-04 10:13:01,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:01,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:01,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 10:13:01,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931302470] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:01,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 12 [2025-03-04 10:13:01,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712451938] [2025-03-04 10:13:01,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:01,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:13:01,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:01,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:13:01,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:13:01,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:13:01,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:01,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:01,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:13:01,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:02,285 INFO L124 PetriNetUnfolderBase]: 3002/5039 cut-off events. [2025-03-04 10:13:02,285 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 10:13:02,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9426 conditions, 5039 events. 3002/5039 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32753 event pairs, 1254 based on Foata normal form. 0/4493 useless extension candidates. Maximal degree in co-relation 3141. Up to 2775 conditions per place. [2025-03-04 10:13:02,310 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 50 selfloop transitions, 12 changer transitions 0/76 dead transitions. [2025-03-04 10:13:02,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 358 flow [2025-03-04 10:13:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:13:02,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 10:13:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2025-03-04 10:13:02,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.549636803874092 [2025-03-04 10:13:02,312 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 190 flow. Second operand 7 states and 227 transitions. [2025-03-04 10:13:02,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 358 flow [2025-03-04 10:13:02,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 76 transitions, 349 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:02,314 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 226 flow [2025-03-04 10:13:02,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2025-03-04 10:13:02,314 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 12 predicate places. [2025-03-04 10:13:02,314 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 226 flow [2025-03-04 10:13:02,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:02,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:02,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:02,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:13:02,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:02,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:02,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1735328288, now seen corresponding path program 1 times [2025-03-04 10:13:02,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:02,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651857264] [2025-03-04 10:13:02,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:02,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:02,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:02,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:02,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:02,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:02,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:02,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651857264] [2025-03-04 10:13:02,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651857264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:02,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:02,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:13:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275192652] [2025-03-04 10:13:02,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:02,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:02,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:02,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:02,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 10:13:02,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:02,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:02,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 10:13:02,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:02,761 INFO L124 PetriNetUnfolderBase]: 1937/3245 cut-off events. [2025-03-04 10:13:02,761 INFO L125 PetriNetUnfolderBase]: For 1903/2434 co-relation queries the response was YES. [2025-03-04 10:13:02,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7477 conditions, 3245 events. 1937/3245 cut-off events. For 1903/2434 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 19814 event pairs, 1449 based on Foata normal form. 180/3251 useless extension candidates. Maximal degree in co-relation 2491. Up to 2775 conditions per place. [2025-03-04 10:13:02,776 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 39 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-04 10:13:02,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 57 transitions, 306 flow [2025-03-04 10:13:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-03-04 10:13:02,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5127118644067796 [2025-03-04 10:13:02,777 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 226 flow. Second operand 4 states and 121 transitions. [2025-03-04 10:13:02,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 57 transitions, 306 flow [2025-03-04 10:13:02,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 57 transitions, 298 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:02,780 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 220 flow [2025-03-04 10:13:02,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-03-04 10:13:02,780 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2025-03-04 10:13:02,780 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 220 flow [2025-03-04 10:13:02,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:02,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:02,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:02,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:13:02,781 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:02,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1735328289, now seen corresponding path program 1 times [2025-03-04 10:13:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191572203] [2025-03-04 10:13:02,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:02,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:02,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:02,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:02,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:02,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:02,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191572203] [2025-03-04 10:13:02,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191572203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:02,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896397616] [2025-03-04 10:13:02,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:02,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:02,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:02,889 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:02,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:13:02,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:13:02,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:13:02,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:02,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:02,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:13:02,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:02,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:03,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:13:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:03,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896397616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:03,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:03,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 10:13:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656949372] [2025-03-04 10:13:03,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:03,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:13:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:03,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:13:03,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:13:03,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:03,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 220 flow. Second operand has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:03,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:03,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:03,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:03,546 INFO L124 PetriNetUnfolderBase]: 2561/4421 cut-off events. [2025-03-04 10:13:03,546 INFO L125 PetriNetUnfolderBase]: For 1531/1885 co-relation queries the response was YES. [2025-03-04 10:13:03,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10040 conditions, 4421 events. 2561/4421 cut-off events. For 1531/1885 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 28859 event pairs, 1449 based on Foata normal form. 363/4594 useless extension candidates. Maximal degree in co-relation 3345. Up to 2961 conditions per place. [2025-03-04 10:13:03,565 INFO L140 encePairwiseOnDemand]: 50/59 looper letters, 49 selfloop transitions, 12 changer transitions 0/74 dead transitions. [2025-03-04 10:13:03,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 388 flow [2025-03-04 10:13:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:13:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:13:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2025-03-04 10:13:03,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5903954802259888 [2025-03-04 10:13:03,567 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 220 flow. Second operand 6 states and 209 transitions. [2025-03-04 10:13:03,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 388 flow [2025-03-04 10:13:03,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 74 transitions, 383 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:03,571 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 252 flow [2025-03-04 10:13:03,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2025-03-04 10:13:03,573 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 13 predicate places. [2025-03-04 10:13:03,573 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 252 flow [2025-03-04 10:13:03,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.727272727272727) internal successors, (305), 11 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:03,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:03,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:03,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:13:03,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:03,774 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:03,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:03,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2044872783, now seen corresponding path program 1 times [2025-03-04 10:13:03,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:03,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453780015] [2025-03-04 10:13:03,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:03,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:03,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:13:03,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:13:03,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:03,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:03,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:03,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453780015] [2025-03-04 10:13:03,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453780015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:03,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188357827] [2025-03-04 10:13:03,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:03,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:03,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:03,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:03,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:13:03,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:13:03,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:13:03,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:03,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:03,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:03,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:03,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:04,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188357827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:04,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:04,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:13:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057046869] [2025-03-04 10:13:04,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:04,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:13:04,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:04,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:13:04,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:13:04,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:04,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 252 flow. Second operand has 14 states, 14 states have (on average 28.0) internal successors, (392), 14 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:04,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:04,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:04,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:04,383 INFO L124 PetriNetUnfolderBase]: 1600/2650 cut-off events. [2025-03-04 10:13:04,383 INFO L125 PetriNetUnfolderBase]: For 4392/4932 co-relation queries the response was YES. [2025-03-04 10:13:04,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7353 conditions, 2650 events. 1600/2650 cut-off events. For 4392/4932 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14670 event pairs, 886 based on Foata normal form. 0/2484 useless extension candidates. Maximal degree in co-relation 3717. Up to 1183 conditions per place. [2025-03-04 10:13:04,396 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 66 selfloop transitions, 16 changer transitions 0/95 dead transitions. [2025-03-04 10:13:04,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 95 transitions, 562 flow [2025-03-04 10:13:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:13:04,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 10:13:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 311 transitions. [2025-03-04 10:13:04,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5856873822975518 [2025-03-04 10:13:04,397 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 252 flow. Second operand 9 states and 311 transitions. [2025-03-04 10:13:04,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 95 transitions, 562 flow [2025-03-04 10:13:04,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 95 transitions, 522 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:04,400 INFO L231 Difference]: Finished difference. Result has 78 places, 60 transitions, 274 flow [2025-03-04 10:13:04,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=274, PETRI_PLACES=78, PETRI_TRANSITIONS=60} [2025-03-04 10:13:04,401 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 18 predicate places. [2025-03-04 10:13:04,401 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 60 transitions, 274 flow [2025-03-04 10:13:04,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.0) internal successors, (392), 14 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:04,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:04,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:04,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:04,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:04,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:04,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1203200742, now seen corresponding path program 1 times [2025-03-04 10:13:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713179556] [2025-03-04 10:13:04,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:04,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:13:04,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:13:04,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713179556] [2025-03-04 10:13:04,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713179556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98507764] [2025-03-04 10:13:04,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:04,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:04,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:04,680 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:04,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:13:04,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:13:04,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:13:04,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:04,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:04,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:13:04,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:04,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:04,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98507764] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:04,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:04,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 10:13:04,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538764371] [2025-03-04 10:13:04,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:04,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:13:04,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:04,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:13:04,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:13:04,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:04,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 60 transitions, 274 flow. Second operand has 14 states, 14 states have (on average 27.928571428571427) internal successors, (391), 14 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:04,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:04,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:04,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:05,212 INFO L124 PetriNetUnfolderBase]: 1834/3091 cut-off events. [2025-03-04 10:13:05,212 INFO L125 PetriNetUnfolderBase]: For 2606/2794 co-relation queries the response was YES. [2025-03-04 10:13:05,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8104 conditions, 3091 events. 1834/3091 cut-off events. For 2606/2794 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17604 event pairs, 987 based on Foata normal form. 76/3029 useless extension candidates. Maximal degree in co-relation 4031. Up to 1410 conditions per place. [2025-03-04 10:13:05,227 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 74 selfloop transitions, 18 changer transitions 0/105 dead transitions. [2025-03-04 10:13:05,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 597 flow [2025-03-04 10:13:05,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:13:05,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:13:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 351 transitions. [2025-03-04 10:13:05,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5949152542372881 [2025-03-04 10:13:05,229 INFO L175 Difference]: Start difference. First operand has 78 places, 60 transitions, 274 flow. Second operand 10 states and 351 transitions. [2025-03-04 10:13:05,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 597 flow [2025-03-04 10:13:05,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 105 transitions, 571 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 10:13:05,233 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 329 flow [2025-03-04 10:13:05,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=329, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2025-03-04 10:13:05,233 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2025-03-04 10:13:05,233 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 329 flow [2025-03-04 10:13:05,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 27.928571428571427) internal successors, (391), 14 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:05,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:05,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:05,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:13:05,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-04 10:13:05,435 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:05,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:05,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1954493393, now seen corresponding path program 1 times [2025-03-04 10:13:05,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:05,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981795422] [2025-03-04 10:13:05,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:05,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:05,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:05,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:05,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981795422] [2025-03-04 10:13:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981795422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938553362] [2025-03-04 10:13:05,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:05,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:05,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:05,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:05,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:13:05,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:13:05,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:13:05,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:05,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:05,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-04 10:13:05,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:05,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 10:13:05,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:05,860 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:05,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:05,866 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 18 treesize of output 13 [2025-03-04 10:13:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:06,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:06,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938553362] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:06,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:06,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-03-04 10:13:06,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484597163] [2025-03-04 10:13:06,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:06,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:13:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:06,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:13:06,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:13:07,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 59 [2025-03-04 10:13:07,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 329 flow. Second operand has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:07,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:07,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 59 [2025-03-04 10:13:07,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:08,370 INFO L124 PetriNetUnfolderBase]: 2405/3955 cut-off events. [2025-03-04 10:13:08,370 INFO L125 PetriNetUnfolderBase]: For 11174/12238 co-relation queries the response was YES. [2025-03-04 10:13:08,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12375 conditions, 3955 events. 2405/3955 cut-off events. For 11174/12238 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22984 event pairs, 833 based on Foata normal form. 0/3797 useless extension candidates. Maximal degree in co-relation 7910. Up to 1249 conditions per place. [2025-03-04 10:13:08,385 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 112 selfloop transitions, 25 changer transitions 0/149 dead transitions. [2025-03-04 10:13:08,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 149 transitions, 1065 flow [2025-03-04 10:13:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:13:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:13:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 518 transitions. [2025-03-04 10:13:08,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4620874219446922 [2025-03-04 10:13:08,388 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 329 flow. Second operand 19 states and 518 transitions. [2025-03-04 10:13:08,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 149 transitions, 1065 flow [2025-03-04 10:13:08,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 149 transitions, 1017 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 10:13:08,393 INFO L231 Difference]: Finished difference. Result has 102 places, 75 transitions, 430 flow [2025-03-04 10:13:08,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=430, PETRI_PLACES=102, PETRI_TRANSITIONS=75} [2025-03-04 10:13:08,393 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 42 predicate places. [2025-03-04 10:13:08,393 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 75 transitions, 430 flow [2025-03-04 10:13:08,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:08,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:08,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:08,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:08,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:13:08,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:08,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:08,599 INFO L85 PathProgramCache]: Analyzing trace with hash 459753781, now seen corresponding path program 1 times [2025-03-04 10:13:08,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:08,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649470022] [2025-03-04 10:13:08,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:08,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:08,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:13:08,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:13:08,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:08,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:08,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649470022] [2025-03-04 10:13:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649470022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:08,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943923535] [2025-03-04 10:13:08,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:08,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:08,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:08,780 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:08,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:13:08,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:13:08,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:13:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:08,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:13:08,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:08,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:09,042 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 36 treesize of output 32 [2025-03-04 10:13:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:09,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943923535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:09,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:09,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-03-04 10:13:09,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656923070] [2025-03-04 10:13:09,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:09,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:13:09,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:09,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:13:09,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:13:09,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:09,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 75 transitions, 430 flow. Second operand has 20 states, 20 states have (on average 28.1) internal successors, (562), 20 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:09,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:09,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:09,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:10,316 INFO L124 PetriNetUnfolderBase]: 2256/3773 cut-off events. [2025-03-04 10:13:10,316 INFO L125 PetriNetUnfolderBase]: For 11206/12276 co-relation queries the response was YES. [2025-03-04 10:13:10,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13071 conditions, 3773 events. 2256/3773 cut-off events. For 11206/12276 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22126 event pairs, 833 based on Foata normal form. 3/3634 useless extension candidates. Maximal degree in co-relation 9054. Up to 856 conditions per place. [2025-03-04 10:13:10,350 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 92 selfloop transitions, 32 changer transitions 0/139 dead transitions. [2025-03-04 10:13:10,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 139 transitions, 998 flow [2025-03-04 10:13:10,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:13:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:13:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 474 transitions. [2025-03-04 10:13:10,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5738498789346247 [2025-03-04 10:13:10,352 INFO L175 Difference]: Start difference. First operand has 102 places, 75 transitions, 430 flow. Second operand 14 states and 474 transitions. [2025-03-04 10:13:10,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 139 transitions, 998 flow [2025-03-04 10:13:10,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 139 transitions, 966 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-03-04 10:13:10,367 INFO L231 Difference]: Finished difference. Result has 109 places, 81 transitions, 523 flow [2025-03-04 10:13:10,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=523, PETRI_PLACES=109, PETRI_TRANSITIONS=81} [2025-03-04 10:13:10,368 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 49 predicate places. [2025-03-04 10:13:10,368 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 81 transitions, 523 flow [2025-03-04 10:13:10,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 28.1) internal successors, (562), 20 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:10,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:10,368 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:10,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:13:10,569 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1385188848, now seen corresponding path program 2 times [2025-03-04 10:13:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323065561] [2025-03-04 10:13:10,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:10,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:13:10,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:10,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:10,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,756 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:10,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:10,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323065561] [2025-03-04 10:13:10,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323065561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:10,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542524186] [2025-03-04 10:13:10,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:10,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:10,758 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:10,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:13:10,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-04 10:13:10,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:13:10,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:10,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:10,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:13:10,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:10,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:10,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:13:10,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 10:13:10,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:10,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:10,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:11,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:13:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542524186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:11,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2025-03-04 10:13:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380782411] [2025-03-04 10:13:11,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:13:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:11,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:13:11,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:13:11,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 10:13:11,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 81 transitions, 523 flow. Second operand has 19 states, 19 states have (on average 24.36842105263158) internal successors, (463), 19 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:11,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:11,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 10:13:11,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:12,816 INFO L124 PetriNetUnfolderBase]: 3278/5139 cut-off events. [2025-03-04 10:13:12,816 INFO L125 PetriNetUnfolderBase]: For 18434/20216 co-relation queries the response was YES. [2025-03-04 10:13:12,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19312 conditions, 5139 events. 3278/5139 cut-off events. For 18434/20216 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 29070 event pairs, 737 based on Foata normal form. 0/5000 useless extension candidates. Maximal degree in co-relation 15233. Up to 1468 conditions per place. [2025-03-04 10:13:12,844 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 144 selfloop transitions, 23 changer transitions 0/180 dead transitions. [2025-03-04 10:13:12,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 180 transitions, 1461 flow [2025-03-04 10:13:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:13:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:13:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 473 transitions. [2025-03-04 10:13:12,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5010593220338984 [2025-03-04 10:13:12,846 INFO L175 Difference]: Start difference. First operand has 109 places, 81 transitions, 523 flow. Second operand 16 states and 473 transitions. [2025-03-04 10:13:12,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 180 transitions, 1461 flow [2025-03-04 10:13:12,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 180 transitions, 1427 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 10:13:12,858 INFO L231 Difference]: Finished difference. Result has 117 places, 85 transitions, 561 flow [2025-03-04 10:13:12,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=561, PETRI_PLACES=117, PETRI_TRANSITIONS=85} [2025-03-04 10:13:12,859 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 57 predicate places. [2025-03-04 10:13:12,859 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 85 transitions, 561 flow [2025-03-04 10:13:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 24.36842105263158) internal successors, (463), 19 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:12,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:12,859 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:12,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:13,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:13:13,064 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash 160928903, now seen corresponding path program 2 times [2025-03-04 10:13:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834968772] [2025-03-04 10:13:13,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:13,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:13,070 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:13:13,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:13,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:13,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:13,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834968772] [2025-03-04 10:13:13,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834968772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:13,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29785185] [2025-03-04 10:13:13,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:13,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:13,334 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:13,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:13:13,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-04 10:13:13,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:13,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:13,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:13,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:13:13,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:13,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:13,476 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:13:13,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-04 10:13:13,485 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:13,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:13,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:13,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-04 10:13:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29785185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:13,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 21 [2025-03-04 10:13:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994118976] [2025-03-04 10:13:13,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:13:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:13,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:13:13,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:13:17,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:13:22,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:13:26,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:13:30,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 10:13:31,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 59 [2025-03-04 10:13:31,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 85 transitions, 561 flow. Second operand has 23 states, 23 states have (on average 22.08695652173913) internal successors, (508), 23 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:31,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:31,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 59 [2025-03-04 10:13:31,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:32,456 INFO L124 PetriNetUnfolderBase]: 5352/8216 cut-off events. [2025-03-04 10:13:32,457 INFO L125 PetriNetUnfolderBase]: For 19544/20335 co-relation queries the response was YES. [2025-03-04 10:13:32,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30088 conditions, 8216 events. 5352/8216 cut-off events. For 19544/20335 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 47596 event pairs, 932 based on Foata normal form. 228/8360 useless extension candidates. Maximal degree in co-relation 24597. Up to 1827 conditions per place. [2025-03-04 10:13:32,492 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 203 selfloop transitions, 30 changer transitions 0/245 dead transitions. [2025-03-04 10:13:32,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 245 transitions, 1896 flow [2025-03-04 10:13:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 10:13:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 10:13:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 554 transitions. [2025-03-04 10:13:32,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49420160570918825 [2025-03-04 10:13:32,494 INFO L175 Difference]: Start difference. First operand has 117 places, 85 transitions, 561 flow. Second operand 19 states and 554 transitions. [2025-03-04 10:13:32,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 245 transitions, 1896 flow [2025-03-04 10:13:32,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 245 transitions, 1862 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-03-04 10:13:32,511 INFO L231 Difference]: Finished difference. Result has 127 places, 92 transitions, 662 flow [2025-03-04 10:13:32,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=662, PETRI_PLACES=127, PETRI_TRANSITIONS=92} [2025-03-04 10:13:32,511 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 67 predicate places. [2025-03-04 10:13:32,511 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 92 transitions, 662 flow [2025-03-04 10:13:32,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 22.08695652173913) internal successors, (508), 23 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:32,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:32,511 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:32,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:13:32,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:13:32,716 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:32,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash -8817941, now seen corresponding path program 1 times [2025-03-04 10:13:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:32,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254968694] [2025-03-04 10:13:32,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:32,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:13:32,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:32,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:32,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:32,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:32,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254968694] [2025-03-04 10:13:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254968694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:32,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853625610] [2025-03-04 10:13:32,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:32,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:32,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:32,881 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:32,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:13:32,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:13:32,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:13:32,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:32,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:32,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:13:32,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:33,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:33,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-04 10:13:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853625610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:33,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 10:13:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342407433] [2025-03-04 10:13:33,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:33,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 10:13:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:33,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 10:13:33,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 10:13:33,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:33,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 92 transitions, 662 flow. Second operand has 18 states, 18 states have (on average 28.166666666666668) internal successors, (507), 18 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:33,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:33,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:33,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:34,641 INFO L124 PetriNetUnfolderBase]: 3530/5917 cut-off events. [2025-03-04 10:13:34,641 INFO L125 PetriNetUnfolderBase]: For 29363/30996 co-relation queries the response was YES. [2025-03-04 10:13:34,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23960 conditions, 5917 events. 3530/5917 cut-off events. For 29363/30996 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 35988 event pairs, 1036 based on Foata normal form. 0/5784 useless extension candidates. Maximal degree in co-relation 19390. Up to 1863 conditions per place. [2025-03-04 10:13:34,681 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 132 selfloop transitions, 24 changer transitions 0/172 dead transitions. [2025-03-04 10:13:34,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 172 transitions, 1502 flow [2025-03-04 10:13:34,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:13:34,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 10:13:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 472 transitions. [2025-03-04 10:13:34,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-03-04 10:13:34,683 INFO L175 Difference]: Start difference. First operand has 127 places, 92 transitions, 662 flow. Second operand 14 states and 472 transitions. [2025-03-04 10:13:34,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 172 transitions, 1502 flow [2025-03-04 10:13:34,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 172 transitions, 1443 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-03-04 10:13:34,703 INFO L231 Difference]: Finished difference. Result has 133 places, 94 transitions, 705 flow [2025-03-04 10:13:34,703 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=705, PETRI_PLACES=133, PETRI_TRANSITIONS=94} [2025-03-04 10:13:34,703 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 73 predicate places. [2025-03-04 10:13:34,703 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 94 transitions, 705 flow [2025-03-04 10:13:34,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 28.166666666666668) internal successors, (507), 18 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:34,704 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:34,704 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:34,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 10:13:34,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:13:34,904 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:34,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash 693829419, now seen corresponding path program 1 times [2025-03-04 10:13:34,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:34,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043949667] [2025-03-04 10:13:34,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:34,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:34,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:13:34,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:13:34,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:34,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043949667] [2025-03-04 10:13:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043949667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290702625] [2025-03-04 10:13:35,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:35,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:35,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:35,107 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:35,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:13:35,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 10:13:35,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 10:13:35,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:35,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:35,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:13:35,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:35,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:35,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-04 10:13:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 10:13:35,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290702625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:35,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:35,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-03-04 10:13:35,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233691932] [2025-03-04 10:13:35,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:35,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:13:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:35,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:13:35,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:13:36,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:13:36,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 94 transitions, 705 flow. Second operand has 22 states, 22 states have (on average 26.954545454545453) internal successors, (593), 22 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:36,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:36,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:13:36,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:37,456 INFO L124 PetriNetUnfolderBase]: 4482/7841 cut-off events. [2025-03-04 10:13:37,456 INFO L125 PetriNetUnfolderBase]: For 32605/33074 co-relation queries the response was YES. [2025-03-04 10:13:37,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31233 conditions, 7841 events. 4482/7841 cut-off events. For 32605/33074 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 50261 event pairs, 1945 based on Foata normal form. 508/8113 useless extension candidates. Maximal degree in co-relation 25638. Up to 2742 conditions per place. [2025-03-04 10:13:37,504 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 127 selfloop transitions, 19 changer transitions 3/162 dead transitions. [2025-03-04 10:13:37,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 162 transitions, 1416 flow [2025-03-04 10:13:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:13:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 10:13:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 403 transitions. [2025-03-04 10:13:37,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5692090395480226 [2025-03-04 10:13:37,505 INFO L175 Difference]: Start difference. First operand has 133 places, 94 transitions, 705 flow. Second operand 12 states and 403 transitions. [2025-03-04 10:13:37,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 162 transitions, 1416 flow [2025-03-04 10:13:37,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 162 transitions, 1357 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-03-04 10:13:37,531 INFO L231 Difference]: Finished difference. Result has 132 places, 89 transitions, 652 flow [2025-03-04 10:13:37,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=652, PETRI_PLACES=132, PETRI_TRANSITIONS=89} [2025-03-04 10:13:37,531 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 72 predicate places. [2025-03-04 10:13:37,531 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 89 transitions, 652 flow [2025-03-04 10:13:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 26.954545454545453) internal successors, (593), 22 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:37,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:37,532 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:37,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:37,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:37,732 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:37,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash 420371067, now seen corresponding path program 1 times [2025-03-04 10:13:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:37,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264128309] [2025-03-04 10:13:37,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:37,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:37,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:13:37,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:13:37,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:37,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264128309] [2025-03-04 10:13:37,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264128309] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:37,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933630614] [2025-03-04 10:13:37,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:37,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:37,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:37,804 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:37,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:13:37,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:13:37,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:13:37,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:37,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:37,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:13:37,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:37,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:37,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933630614] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:37,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:37,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-04 10:13:37,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330046929] [2025-03-04 10:13:37,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:37,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 10:13:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:37,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 10:13:37,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:13:38,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:38,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 89 transitions, 652 flow. Second operand has 15 states, 15 states have (on average 28.533333333333335) internal successors, (428), 15 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:38,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:38,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:38,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:38,591 INFO L124 PetriNetUnfolderBase]: 3170/5255 cut-off events. [2025-03-04 10:13:38,591 INFO L125 PetriNetUnfolderBase]: For 25691/26492 co-relation queries the response was YES. [2025-03-04 10:13:38,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21275 conditions, 5255 events. 3170/5255 cut-off events. For 25691/26492 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 30286 event pairs, 2027 based on Foata normal form. 46/5253 useless extension candidates. Maximal degree in co-relation 17695. Up to 3350 conditions per place. [2025-03-04 10:13:38,624 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 76 selfloop transitions, 20 changer transitions 15/126 dead transitions. [2025-03-04 10:13:38,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 126 transitions, 1123 flow [2025-03-04 10:13:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:13:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 10:13:38,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 343 transitions. [2025-03-04 10:13:38,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813559322033899 [2025-03-04 10:13:38,625 INFO L175 Difference]: Start difference. First operand has 132 places, 89 transitions, 652 flow. Second operand 10 states and 343 transitions. [2025-03-04 10:13:38,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 126 transitions, 1123 flow [2025-03-04 10:13:38,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 126 transitions, 1062 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-03-04 10:13:38,642 INFO L231 Difference]: Finished difference. Result has 127 places, 79 transitions, 544 flow [2025-03-04 10:13:38,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=544, PETRI_PLACES=127, PETRI_TRANSITIONS=79} [2025-03-04 10:13:38,643 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 67 predicate places. [2025-03-04 10:13:38,643 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 79 transitions, 544 flow [2025-03-04 10:13:38,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.533333333333335) internal successors, (428), 15 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:38,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:38,643 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:38,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:38,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:38,844 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:38,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:38,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1804571806, now seen corresponding path program 2 times [2025-03-04 10:13:38,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:38,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13279945] [2025-03-04 10:13:38,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:38,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:38,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:13:38,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:13:38,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:38,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:38,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13279945] [2025-03-04 10:13:38,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13279945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:38,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772080916] [2025-03-04 10:13:38,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:38,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:38,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:38,940 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:38,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:13:38,991 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 10:13:39,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:13:39,011 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:39,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:39,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:13:39,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:39,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772080916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:39,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2025-03-04 10:13:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794081717] [2025-03-04 10:13:39,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:39,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 10:13:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:39,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 10:13:39,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2025-03-04 10:13:39,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:39,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 79 transitions, 544 flow. Second operand has 19 states, 19 states have (on average 27.94736842105263) internal successors, (531), 19 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:39,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:39,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:39,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:40,141 INFO L124 PetriNetUnfolderBase]: 5985/10447 cut-off events. [2025-03-04 10:13:40,141 INFO L125 PetriNetUnfolderBase]: For 33881/34758 co-relation queries the response was YES. [2025-03-04 10:13:40,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39932 conditions, 10447 events. 5985/10447 cut-off events. For 33881/34758 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 71684 event pairs, 2911 based on Foata normal form. 0/10177 useless extension candidates. Maximal degree in co-relation 36255. Up to 4061 conditions per place. [2025-03-04 10:13:40,215 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 153 selfloop transitions, 33 changer transitions 0/199 dead transitions. [2025-03-04 10:13:40,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 199 transitions, 1711 flow [2025-03-04 10:13:40,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 10:13:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 10:13:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 547 transitions. [2025-03-04 10:13:40,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5794491525423728 [2025-03-04 10:13:40,216 INFO L175 Difference]: Start difference. First operand has 127 places, 79 transitions, 544 flow. Second operand 16 states and 547 transitions. [2025-03-04 10:13:40,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 199 transitions, 1711 flow [2025-03-04 10:13:40,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 199 transitions, 1559 flow, removed 15 selfloop flow, removed 17 redundant places. [2025-03-04 10:13:40,252 INFO L231 Difference]: Finished difference. Result has 131 places, 93 transitions, 691 flow [2025-03-04 10:13:40,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=691, PETRI_PLACES=131, PETRI_TRANSITIONS=93} [2025-03-04 10:13:40,253 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 71 predicate places. [2025-03-04 10:13:40,253 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 93 transitions, 691 flow [2025-03-04 10:13:40,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 27.94736842105263) internal successors, (531), 19 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:40,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:40,253 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:40,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 10:13:40,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:40,456 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:40,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1225854812, now seen corresponding path program 2 times [2025-03-04 10:13:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872012970] [2025-03-04 10:13:40,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:40,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:40,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:13:40,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:40,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:40,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:40,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872012970] [2025-03-04 10:13:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872012970] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259124478] [2025-03-04 10:13:40,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:40,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:40,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:40,650 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:40,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:13:40,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-04 10:13:40,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:40,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:40,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:40,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:13:40,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:40,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:13:40,822 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 10:13:40,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-03-04 10:13:40,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:13:40,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:13:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:13:40,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:41,218 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 65 treesize of output 61 [2025-03-04 10:13:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 10:13:41,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259124478] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:41,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:41,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2025-03-04 10:13:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918620342] [2025-03-04 10:13:41,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:41,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:13:41,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:41,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:13:41,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:13:42,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 59 [2025-03-04 10:13:42,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 93 transitions, 691 flow. Second operand has 24 states, 24 states have (on average 24.666666666666668) internal successors, (592), 24 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:42,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:42,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 59 [2025-03-04 10:13:42,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:43,728 INFO L124 PetriNetUnfolderBase]: 7318/10976 cut-off events. [2025-03-04 10:13:43,728 INFO L125 PetriNetUnfolderBase]: For 45353/47249 co-relation queries the response was YES. [2025-03-04 10:13:43,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44361 conditions, 10976 events. 7318/10976 cut-off events. For 45353/47249 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 65249 event pairs, 1151 based on Foata normal form. 200/11060 useless extension candidates. Maximal degree in co-relation 40797. Up to 4000 conditions per place. [2025-03-04 10:13:43,790 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 139 selfloop transitions, 19 changer transitions 0/170 dead transitions. [2025-03-04 10:13:43,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 170 transitions, 1600 flow [2025-03-04 10:13:43,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 248 transitions. [2025-03-04 10:13:43,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5254237288135594 [2025-03-04 10:13:43,791 INFO L175 Difference]: Start difference. First operand has 131 places, 93 transitions, 691 flow. Second operand 8 states and 248 transitions. [2025-03-04 10:13:43,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 170 transitions, 1600 flow [2025-03-04 10:13:43,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 170 transitions, 1585 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 10:13:43,821 INFO L231 Difference]: Finished difference. Result has 136 places, 94 transitions, 729 flow [2025-03-04 10:13:43,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=729, PETRI_PLACES=136, PETRI_TRANSITIONS=94} [2025-03-04 10:13:43,822 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 76 predicate places. [2025-03-04 10:13:43,822 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 94 transitions, 729 flow [2025-03-04 10:13:43,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 24.666666666666668) internal successors, (592), 24 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:43,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:43,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:43,829 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-04 10:13:44,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:44,023 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:44,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 490133334, now seen corresponding path program 1 times [2025-03-04 10:13:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247320562] [2025-03-04 10:13:44,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:44,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:44,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:13:44,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:13:44,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:44,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:13:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247320562] [2025-03-04 10:13:44,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247320562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:44,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:44,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:13:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233663583] [2025-03-04 10:13:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:13:44,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:44,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:13:44,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:13:44,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-03-04 10:13:44,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 94 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:44,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:44,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-03-04 10:13:44,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:44,802 INFO L124 PetriNetUnfolderBase]: 5302/9224 cut-off events. [2025-03-04 10:13:44,802 INFO L125 PetriNetUnfolderBase]: For 39688/40951 co-relation queries the response was YES. [2025-03-04 10:13:44,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37542 conditions, 9224 events. 5302/9224 cut-off events. For 39688/40951 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 62635 event pairs, 1433 based on Foata normal form. 1/9064 useless extension candidates. Maximal degree in co-relation 34525. Up to 6765 conditions per place. [2025-03-04 10:13:44,855 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 98 selfloop transitions, 6 changer transitions 1/121 dead transitions. [2025-03-04 10:13:44,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 121 transitions, 1117 flow [2025-03-04 10:13:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:13:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:13:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-03-04 10:13:44,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7401129943502824 [2025-03-04 10:13:44,856 INFO L175 Difference]: Start difference. First operand has 136 places, 94 transitions, 729 flow. Second operand 3 states and 131 transitions. [2025-03-04 10:13:44,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 121 transitions, 1117 flow [2025-03-04 10:13:44,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 121 transitions, 1078 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:44,887 INFO L231 Difference]: Finished difference. Result has 134 places, 99 transitions, 764 flow [2025-03-04 10:13:44,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=764, PETRI_PLACES=134, PETRI_TRANSITIONS=99} [2025-03-04 10:13:44,888 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 74 predicate places. [2025-03-04 10:13:44,888 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 99 transitions, 764 flow [2025-03-04 10:13:44,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:44,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:44,888 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:44,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 10:13:44,888 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:44,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:44,888 INFO L85 PathProgramCache]: Analyzing trace with hash -653205750, now seen corresponding path program 1 times [2025-03-04 10:13:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:44,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876700289] [2025-03-04 10:13:44,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:44,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:13:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:13:44,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:44,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 10:13:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876700289] [2025-03-04 10:13:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876700289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088650734] [2025-03-04 10:13:45,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:45,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:45,039 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:45,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:13:45,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:13:45,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:13:45,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:45,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:45,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:13:45,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:45,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:45,508 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 36 treesize of output 32 [2025-03-04 10:13:45,633 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:45,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088650734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:45,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:45,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-03-04 10:13:45,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696259751] [2025-03-04 10:13:45,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:45,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:13:45,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:45,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:13:45,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:13:46,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-03-04 10:13:46,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 99 transitions, 764 flow. Second operand has 28 states, 28 states have (on average 27.357142857142858) internal successors, (766), 28 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:46,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:46,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-03-04 10:13:46,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:48,959 INFO L124 PetriNetUnfolderBase]: 9239/14188 cut-off events. [2025-03-04 10:13:48,959 INFO L125 PetriNetUnfolderBase]: For 69998/72474 co-relation queries the response was YES. [2025-03-04 10:13:49,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60750 conditions, 14188 events. 9239/14188 cut-off events. For 69998/72474 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 91437 event pairs, 1700 based on Foata normal form. 300/14120 useless extension candidates. Maximal degree in co-relation 57573. Up to 2220 conditions per place. [2025-03-04 10:13:49,060 INFO L140 encePairwiseOnDemand]: 47/59 looper letters, 342 selfloop transitions, 48 changer transitions 0/403 dead transitions. [2025-03-04 10:13:49,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 403 transitions, 3630 flow [2025-03-04 10:13:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:13:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 10:13:49,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1042 transitions. [2025-03-04 10:13:49,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5887005649717514 [2025-03-04 10:13:49,061 INFO L175 Difference]: Start difference. First operand has 134 places, 99 transitions, 764 flow. Second operand 30 states and 1042 transitions. [2025-03-04 10:13:49,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 403 transitions, 3630 flow [2025-03-04 10:13:49,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 403 transitions, 3575 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:13:49,222 INFO L231 Difference]: Finished difference. Result has 158 places, 113 transitions, 947 flow [2025-03-04 10:13:49,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=947, PETRI_PLACES=158, PETRI_TRANSITIONS=113} [2025-03-04 10:13:49,222 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 98 predicate places. [2025-03-04 10:13:49,223 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 113 transitions, 947 flow [2025-03-04 10:13:49,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 27.357142857142858) internal successors, (766), 28 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:49,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:49,223 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:49,229 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-04 10:13:49,423 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-04 10:13:49,424 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:49,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:49,424 INFO L85 PathProgramCache]: Analyzing trace with hash -602786109, now seen corresponding path program 3 times [2025-03-04 10:13:49,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:49,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193350598] [2025-03-04 10:13:49,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:49,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:49,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-04 10:13:49,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-03-04 10:13:49,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:49,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 10:13:49,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193350598] [2025-03-04 10:13:49,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193350598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:49,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491055922] [2025-03-04 10:13:49,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:13:49,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:49,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:49,646 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:49,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 10:13:49,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-04 10:13:49,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 26 statements. [2025-03-04 10:13:49,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:13:49,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:49,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:13:49,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:49,898 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 10:13:49,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:50,090 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 50 treesize of output 46 [2025-03-04 10:13:50,210 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-04 10:13:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491055922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:50,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2025-03-04 10:13:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499620657] [2025-03-04 10:13:50,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:50,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 10:13:50,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:50,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 10:13:50,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2025-03-04 10:13:50,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-03-04 10:13:50,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 113 transitions, 947 flow. Second operand has 24 states, 24 states have (on average 26.25) internal successors, (630), 24 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:50,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:50,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-03-04 10:13:50,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:52,939 INFO L124 PetriNetUnfolderBase]: 14298/21453 cut-off events. [2025-03-04 10:13:52,939 INFO L125 PetriNetUnfolderBase]: For 84049/85470 co-relation queries the response was YES. [2025-03-04 10:13:53,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88309 conditions, 21453 events. 14298/21453 cut-off events. For 84049/85470 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 138153 event pairs, 2367 based on Foata normal form. 164/21297 useless extension candidates. Maximal degree in co-relation 63503. Up to 4928 conditions per place. [2025-03-04 10:13:53,143 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 223 selfloop transitions, 26 changer transitions 0/263 dead transitions. [2025-03-04 10:13:53,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 263 transitions, 2580 flow [2025-03-04 10:13:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:13:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:13:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 289 transitions. [2025-03-04 10:13:53,144 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6122881355932204 [2025-03-04 10:13:53,144 INFO L175 Difference]: Start difference. First operand has 158 places, 113 transitions, 947 flow. Second operand 8 states and 289 transitions. [2025-03-04 10:13:53,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 263 transitions, 2580 flow [2025-03-04 10:13:53,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 263 transitions, 2241 flow, removed 24 selfloop flow, removed 22 redundant places. [2025-03-04 10:13:53,451 INFO L231 Difference]: Finished difference. Result has 142 places, 113 transitions, 857 flow [2025-03-04 10:13:53,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=857, PETRI_PLACES=142, PETRI_TRANSITIONS=113} [2025-03-04 10:13:53,452 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 82 predicate places. [2025-03-04 10:13:53,452 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 113 transitions, 857 flow [2025-03-04 10:13:53,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 26.25) internal successors, (630), 24 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:53,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:53,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:53,460 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 10:13:53,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:53,653 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:53,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:53,653 INFO L85 PathProgramCache]: Analyzing trace with hash -962692033, now seen corresponding path program 1 times [2025-03-04 10:13:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399400167] [2025-03-04 10:13:53,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:53,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:53,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 10:13:53,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:13:53,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:53,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:13:53,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:53,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399400167] [2025-03-04 10:13:53,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399400167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:13:53,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:13:53,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:13:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109024493] [2025-03-04 10:13:53,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:53,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:13:53,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:53,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:13:53,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:13:53,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:53,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 113 transitions, 857 flow. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:53,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:53,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:53,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:54,918 INFO L124 PetriNetUnfolderBase]: 8784/14027 cut-off events. [2025-03-04 10:13:54,918 INFO L125 PetriNetUnfolderBase]: For 64887/66750 co-relation queries the response was YES. [2025-03-04 10:13:54,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57746 conditions, 14027 events. 8784/14027 cut-off events. For 64887/66750 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 94328 event pairs, 2107 based on Foata normal form. 314/13880 useless extension candidates. Maximal degree in co-relation 36501. Up to 7959 conditions per place. [2025-03-04 10:13:55,030 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 108 selfloop transitions, 19 changer transitions 0/140 dead transitions. [2025-03-04 10:13:55,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 140 transitions, 1357 flow [2025-03-04 10:13:55,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:13:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 10:13:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2025-03-04 10:13:55,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6271186440677966 [2025-03-04 10:13:55,031 INFO L175 Difference]: Start difference. First operand has 142 places, 113 transitions, 857 flow. Second operand 4 states and 148 transitions. [2025-03-04 10:13:55,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 140 transitions, 1357 flow [2025-03-04 10:13:55,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 1284 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 10:13:55,080 INFO L231 Difference]: Finished difference. Result has 138 places, 109 transitions, 812 flow [2025-03-04 10:13:55,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=812, PETRI_PLACES=138, PETRI_TRANSITIONS=109} [2025-03-04 10:13:55,081 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 78 predicate places. [2025-03-04 10:13:55,081 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 109 transitions, 812 flow [2025-03-04 10:13:55,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:55,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:55,081 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:55,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 10:13:55,081 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:55,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:55,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1450532427, now seen corresponding path program 1 times [2025-03-04 10:13:55,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:55,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828504967] [2025-03-04 10:13:55,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:55,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:13:55,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:13:55,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:55,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:13:55,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828504967] [2025-03-04 10:13:55,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828504967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:55,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572868436] [2025-03-04 10:13:55,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:55,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:55,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:55,175 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:55,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:13:55,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:13:55,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:13:55,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:55,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:55,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 10:13:55,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:13:55,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 10:13:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572868436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:55,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-03-04 10:13:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004726555] [2025-03-04 10:13:55,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:13:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:55,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:13:55,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:13:55,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:55,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 109 transitions, 812 flow. Second operand has 20 states, 20 states have (on average 28.7) internal successors, (574), 20 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:55,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:55,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:55,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:56,493 INFO L124 PetriNetUnfolderBase]: 6615/10580 cut-off events. [2025-03-04 10:13:56,495 INFO L125 PetriNetUnfolderBase]: For 47618/48823 co-relation queries the response was YES. [2025-03-04 10:13:56,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42648 conditions, 10580 events. 6615/10580 cut-off events. For 47618/48823 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 67669 event pairs, 3338 based on Foata normal form. 196/10673 useless extension candidates. Maximal degree in co-relation 29262. Up to 4287 conditions per place. [2025-03-04 10:13:56,569 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 133 selfloop transitions, 31 changer transitions 0/182 dead transitions. [2025-03-04 10:13:56,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 182 transitions, 1632 flow [2025-03-04 10:13:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:13:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 10:13:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 497 transitions. [2025-03-04 10:13:56,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5615819209039548 [2025-03-04 10:13:56,570 INFO L175 Difference]: Start difference. First operand has 138 places, 109 transitions, 812 flow. Second operand 15 states and 497 transitions. [2025-03-04 10:13:56,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 182 transitions, 1632 flow [2025-03-04 10:13:56,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 182 transitions, 1566 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 10:13:56,601 INFO L231 Difference]: Finished difference. Result has 152 places, 113 transitions, 895 flow [2025-03-04 10:13:56,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=895, PETRI_PLACES=152, PETRI_TRANSITIONS=113} [2025-03-04 10:13:56,602 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 92 predicate places. [2025-03-04 10:13:56,602 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 113 transitions, 895 flow [2025-03-04 10:13:56,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 28.7) internal successors, (574), 20 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:56,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:56,602 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:56,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:13:56,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 10:13:56,803 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:56,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:56,803 INFO L85 PathProgramCache]: Analyzing trace with hash 19482440, now seen corresponding path program 1 times [2025-03-04 10:13:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:56,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048698523] [2025-03-04 10:13:56,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:56,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:56,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:13:56,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:13:56,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:56,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:13:56,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:56,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048698523] [2025-03-04 10:13:56,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048698523] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:56,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273693532] [2025-03-04 10:13:56,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:13:56,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:56,854 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:56,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:13:56,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 10:13:56,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 10:13:56,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:13:56,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:56,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:13:56,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:56,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:13:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273693532] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:13:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-03-04 10:13:56,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133051722] [2025-03-04 10:13:56,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:13:56,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:13:56,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:56,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:13:56,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:13:56,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:56,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 113 transitions, 895 flow. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:56,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:56,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:56,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:13:58,205 INFO L124 PetriNetUnfolderBase]: 7867/12972 cut-off events. [2025-03-04 10:13:58,205 INFO L125 PetriNetUnfolderBase]: For 54899/55699 co-relation queries the response was YES. [2025-03-04 10:13:58,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53119 conditions, 12972 events. 7867/12972 cut-off events. For 54899/55699 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 85474 event pairs, 3488 based on Foata normal form. 44/12695 useless extension candidates. Maximal degree in co-relation 37104. Up to 6247 conditions per place. [2025-03-04 10:13:58,323 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 120 selfloop transitions, 16 changer transitions 0/152 dead transitions. [2025-03-04 10:13:58,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 152 transitions, 1432 flow [2025-03-04 10:13:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:13:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:13:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2025-03-04 10:13:58,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6067796610169491 [2025-03-04 10:13:58,324 INFO L175 Difference]: Start difference. First operand has 152 places, 113 transitions, 895 flow. Second operand 5 states and 179 transitions. [2025-03-04 10:13:58,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 152 transitions, 1432 flow [2025-03-04 10:13:58,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 152 transitions, 1386 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-03-04 10:13:58,435 INFO L231 Difference]: Finished difference. Result has 145 places, 112 transitions, 870 flow [2025-03-04 10:13:58,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=870, PETRI_PLACES=145, PETRI_TRANSITIONS=112} [2025-03-04 10:13:58,436 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 85 predicate places. [2025-03-04 10:13:58,436 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 112 transitions, 870 flow [2025-03-04 10:13:58,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:58,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:13:58,436 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:13:58,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:13:58,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 10:13:58,637 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:13:58,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:13:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1032805612, now seen corresponding path program 2 times [2025-03-04 10:13:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:13:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569511900] [2025-03-04 10:13:58,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:13:58,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:13:58,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:13:58,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:58,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:58,778 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:13:58,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:13:58,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569511900] [2025-03-04 10:13:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569511900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:13:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873668663] [2025-03-04 10:13:58,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:13:58,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:13:58,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:13:58,781 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:13:58,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:13:58,844 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:13:58,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:13:58,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:13:58,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:13:58,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 10:13:58,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:13:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:13:59,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:13:59,123 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:13:59,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873668663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:13:59,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:13:59,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2025-03-04 10:13:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585595176] [2025-03-04 10:13:59,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:13:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 10:13:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:13:59,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 10:13:59,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:13:59,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 59 [2025-03-04 10:13:59,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 112 transitions, 870 flow. Second operand has 23 states, 23 states have (on average 28.347826086956523) internal successors, (652), 23 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:13:59,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:13:59,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 59 [2025-03-04 10:13:59,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:14:00,966 INFO L124 PetriNetUnfolderBase]: 9268/14753 cut-off events. [2025-03-04 10:14:00,966 INFO L125 PetriNetUnfolderBase]: For 81203/82842 co-relation queries the response was YES. [2025-03-04 10:14:01,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63006 conditions, 14753 events. 9268/14753 cut-off events. For 81203/82842 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 97933 event pairs, 3883 based on Foata normal form. 98/14708 useless extension candidates. Maximal degree in co-relation 41681. Up to 4287 conditions per place. [2025-03-04 10:14:01,047 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 183 selfloop transitions, 53 changer transitions 0/254 dead transitions. [2025-03-04 10:14:01,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 254 transitions, 2456 flow [2025-03-04 10:14:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 10:14:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-04 10:14:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 601 transitions. [2025-03-04 10:14:01,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5659133709981168 [2025-03-04 10:14:01,049 INFO L175 Difference]: Start difference. First operand has 145 places, 112 transitions, 870 flow. Second operand 18 states and 601 transitions. [2025-03-04 10:14:01,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 254 transitions, 2456 flow [2025-03-04 10:14:01,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 254 transitions, 2368 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 10:14:01,108 INFO L231 Difference]: Finished difference. Result has 163 places, 137 transitions, 1276 flow [2025-03-04 10:14:01,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1276, PETRI_PLACES=163, PETRI_TRANSITIONS=137} [2025-03-04 10:14:01,108 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, 103 predicate places. [2025-03-04 10:14:01,109 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 137 transitions, 1276 flow [2025-03-04 10:14:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 28.347826086956523) internal successors, (652), 23 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:14:01,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:14:01,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:14:01,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-04 10:14:01,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 10:14:01,309 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2025-03-04 10:14:01,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:14:01,310 INFO L85 PathProgramCache]: Analyzing trace with hash -112979337, now seen corresponding path program 1 times [2025-03-04 10:14:01,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:14:01,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751983721] [2025-03-04 10:14:01,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:14:01,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:14:01,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:14:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:01,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:14:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751983721] [2025-03-04 10:14:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751983721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:14:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659373601] [2025-03-04 10:14:01,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:14:01,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:14:01,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:14:01,816 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:14:01,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:14:01,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:14:01,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:14:01,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:14:01,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:14:01,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 10:14:01,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:14:01,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 10:14:01,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-03-04 10:14:01,958 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 10:14:01,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 10:14:01,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 10:14:02,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 10:14:02,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 10:14:02,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:14:10,685 INFO L349 Elim1Store]: treesize reduction 28, result has 64.6 percent of original size [2025-03-04 10:14:10,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 792 treesize of output 602 [2025-03-04 10:14:10,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 10:14:10,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 582 treesize of output 542 [2025-03-04 10:14:13,742 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-04 10:14:17,553 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-04 10:14:23,787 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-04 10:14:23,844 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-04 10:14:24,223 INFO L349 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2025-03-04 10:14:24,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 168