./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:20:15,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:20:15,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 01:20:15,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:20:15,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:20:15,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:20:15,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:20:15,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:20:15,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:20:15,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:20:15,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:20:15,907 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 01:20:15,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:20:15,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:15,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:20:15,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:20:15,909 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-03-09 01:20:16,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:20:16,114 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:20:16,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:20:16,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:20:16,117 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:20:16,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-09 01:20:17,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae452cb56/b910df662d6e4ca7b4c53b8da18b4910/FLAG6e2bb9b77 [2025-03-09 01:20:17,448 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:20:17,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-09 01:20:17,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae452cb56/b910df662d6e4ca7b4c53b8da18b4910/FLAG6e2bb9b77 [2025-03-09 01:20:17,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae452cb56/b910df662d6e4ca7b4c53b8da18b4910 [2025-03-09 01:20:17,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:20:17,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:20:17,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:17,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:20:17,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:20:17,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2d95f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17, skipping insertion in model container [2025-03-09 01:20:17,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,490 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:20:17,608 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:20:17,613 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 01:20:17,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:17,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:20:17,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:20:17,670 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:20:17,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17 WrapperNode [2025-03-09 01:20:17,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:20:17,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:17,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:20:17,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:20:17,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,709 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 279 [2025-03-09 01:20:17,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:20:17,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:20:17,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:20:17,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:20:17,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,745 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-03-09 01:20:17,745 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:20:17,756 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:20:17,756 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:20:17,756 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:20:17,757 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (1/1) ... [2025-03-09 01:20:17,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:20:17,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:17,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:20:17,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:20:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:20:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-09 01:20:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-09 01:20:17,798 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-09 01:20:17,798 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:20:17,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:20:17,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:20:17,800 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 01:20:17,893 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:20:17,894 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:20:18,256 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 01:20:18,256 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:20:18,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:20:18,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:20:18,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:18 BoogieIcfgContainer [2025-03-09 01:20:18,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:20:18,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:20:18,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:20:18,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:20:18,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:20:17" (1/3) ... [2025-03-09 01:20:18,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284bd709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:18, skipping insertion in model container [2025-03-09 01:20:18,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:20:17" (2/3) ... [2025-03-09 01:20:18,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284bd709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:20:18, skipping insertion in model container [2025-03-09 01:20:18,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:20:18" (3/3) ... [2025-03-09 01:20:18,510 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-03-09 01:20:18,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:20:18,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 75 locations, 1 initial locations, 4 loop locations, and 34 error locations. [2025-03-09 01:20:18,524 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 01:20:18,574 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 01:20:18,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 82 transitions, 178 flow [2025-03-09 01:20:18,636 INFO L124 PetriNetUnfolderBase]: 8/80 cut-off events. [2025-03-09 01:20:18,638 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:20:18,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 8/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 224 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2025-03-09 01:20:18,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 82 transitions, 178 flow [2025-03-09 01:20:18,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 79 transitions, 170 flow [2025-03-09 01:20:18,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:20:18,663 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;@56a43eac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:20:18,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-09 01:20:18,667 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 01:20:18,667 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-03-09 01:20:18,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 01:20:18,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:18,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:18,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:18,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash 835918, now seen corresponding path program 1 times [2025-03-09 01:20:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739900188] [2025-03-09 01:20:18,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:18,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:18,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:18,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:18,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:18,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739900188] [2025-03-09 01:20:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739900188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 01:20:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072786207] [2025-03-09 01:20:18,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:18,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:18,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:18,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:18,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:18,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:18,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:18,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:18,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:18,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:19,110 INFO L124 PetriNetUnfolderBase]: 192/580 cut-off events. [2025-03-09 01:20:19,113 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-09 01:20:19,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 580 events. 192/580 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3514 event pairs, 113 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 827. Up to 301 conditions per place. [2025-03-09 01:20:19,118 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 32 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-03-09 01:20:19,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 75 transitions, 230 flow [2025-03-09 01:20:19,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-09 01:20:19,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6869918699186992 [2025-03-09 01:20:19,133 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 170 flow. Second operand 3 states and 169 transitions. [2025-03-09 01:20:19,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 75 transitions, 230 flow [2025-03-09 01:20:19,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 222 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:19,140 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 158 flow [2025-03-09 01:20:19,142 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2025-03-09 01:20:19,145 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -6 predicate places. [2025-03-09 01:20:19,146 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 158 flow [2025-03-09 01:20:19,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:19,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:19,146 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-09 01:20:19,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:20:19,147 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:19,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash 835919, now seen corresponding path program 1 times [2025-03-09 01:20:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613845473] [2025-03-09 01:20:19,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:19,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 01:20:19,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 01:20:19,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613845473] [2025-03-09 01:20:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613845473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602395976] [2025-03-09 01:20:19,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:19,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:19,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:19,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:19,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:19,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:19,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:19,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:19,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:19,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:19,596 INFO L124 PetriNetUnfolderBase]: 192/582 cut-off events. [2025-03-09 01:20:19,596 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:20:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 582 events. 192/582 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3506 event pairs, 113 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 877. Up to 309 conditions per place. [2025-03-09 01:20:19,602 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 36 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2025-03-09 01:20:19,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 238 flow [2025-03-09 01:20:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:19,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-03-09 01:20:19,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6991869918699187 [2025-03-09 01:20:19,604 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 158 flow. Second operand 3 states and 172 transitions. [2025-03-09 01:20:19,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 238 flow [2025-03-09 01:20:19,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:19,606 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 168 flow [2025-03-09 01:20:19,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2025-03-09 01:20:19,607 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2025-03-09 01:20:19,607 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 168 flow [2025-03-09 01:20:19,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:19,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:19,607 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-03-09 01:20:19,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:20:19,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:19,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:19,608 INFO L85 PathProgramCache]: Analyzing trace with hash 803343955, now seen corresponding path program 1 times [2025-03-09 01:20:19,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:19,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426719203] [2025-03-09 01:20:19,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:19,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:19,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:19,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:19,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:19,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426719203] [2025-03-09 01:20:19,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426719203] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:19,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253316860] [2025-03-09 01:20:19,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:19,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:19,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:19,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:19,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:20:19,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:20:19,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:20:19,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:19,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:19,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:20:19,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:19,939 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-09 01:20:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:20,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:20:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253316860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:20,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-03-09 01:20:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426689419] [2025-03-09 01:20:20,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:20,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:20:20,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:20,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:20:20,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:20:20,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:20,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 168 flow. Second operand has 11 states, 11 states have (on average 45.36363636363637) internal successors, (499), 11 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:20,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:20,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:20,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:20,811 INFO L124 PetriNetUnfolderBase]: 192/581 cut-off events. [2025-03-09 01:20:20,811 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 01:20:20,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 581 events. 192/581 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3506 event pairs, 113 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 893. Up to 305 conditions per place. [2025-03-09 01:20:20,817 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 32 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-09 01:20:20,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 76 transitions, 240 flow [2025-03-09 01:20:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:20,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 258 transitions. [2025-03-09 01:20:20,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6292682926829268 [2025-03-09 01:20:20,818 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 168 flow. Second operand 5 states and 258 transitions. [2025-03-09 01:20:20,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 76 transitions, 240 flow [2025-03-09 01:20:20,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 76 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:20,820 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 180 flow [2025-03-09 01:20:20,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2025-03-09 01:20:20,820 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2025-03-09 01:20:20,822 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 180 flow [2025-03-09 01:20:20,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 45.36363636363637) internal successors, (499), 11 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:20,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:20,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 01:20:20,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:20:21,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:21,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:21,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash -866138386, now seen corresponding path program 1 times [2025-03-09 01:20:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:21,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800298053] [2025-03-09 01:20:21,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:21,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 01:20:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 01:20:21,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:21,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:21,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800298053] [2025-03-09 01:20:21,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800298053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:21,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:21,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:21,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665574611] [2025-03-09 01:20:21,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:21,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:21,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:21,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:21,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:21,270 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:21,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:21,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:21,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:21,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:21,390 INFO L124 PetriNetUnfolderBase]: 192/583 cut-off events. [2025-03-09 01:20:21,390 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:20:21,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 583 events. 192/583 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3515 event pairs, 113 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 889. Up to 307 conditions per place. [2025-03-09 01:20:21,393 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 35 selfloop transitions, 4 changer transitions 0/78 dead transitions. [2025-03-09 01:20:21,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 262 flow [2025-03-09 01:20:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-03-09 01:20:21,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6615853658536586 [2025-03-09 01:20:21,395 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 180 flow. Second operand 4 states and 217 transitions. [2025-03-09 01:20:21,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 262 flow [2025-03-09 01:20:21,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 252 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:21,397 INFO L231 Difference]: Finished difference. Result has 77 places, 77 transitions, 190 flow [2025-03-09 01:20:21,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2025-03-09 01:20:21,397 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-03-09 01:20:21,397 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 77 transitions, 190 flow [2025-03-09 01:20:21,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:21,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:21,398 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:21,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:20:21,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:21,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:21,398 INFO L85 PathProgramCache]: Analyzing trace with hash 864693412, now seen corresponding path program 1 times [2025-03-09 01:20:21,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:21,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032263654] [2025-03-09 01:20:21,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:21,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:20:21,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:20:21,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:21,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032263654] [2025-03-09 01:20:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032263654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998904654] [2025-03-09 01:20:21,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:21,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:21,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:21,612 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:21,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:20:21,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 01:20:21,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 01:20:21,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:21,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:21,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 01:20:21,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:21,697 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-09 01:20:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:21,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998904654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:21,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-03-09 01:20:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915640800] [2025-03-09 01:20:21,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:21,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 01:20:21,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:21,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 01:20:21,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-09 01:20:22,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:22,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 77 transitions, 190 flow. Second operand has 13 states, 13 states have (on average 45.61538461538461) internal successors, (593), 13 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-09 01:20:22,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:22,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:22,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:22,701 INFO L124 PetriNetUnfolderBase]: 194/588 cut-off events. [2025-03-09 01:20:22,702 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-09 01:20:22,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 588 events. 194/588 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3518 event pairs, 113 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 899. Up to 301 conditions per place. [2025-03-09 01:20:22,706 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 28 selfloop transitions, 16 changer transitions 0/83 dead transitions. [2025-03-09 01:20:22,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 303 flow [2025-03-09 01:20:22,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:20:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 01:20:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 442 transitions. [2025-03-09 01:20:22,708 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5989159891598916 [2025-03-09 01:20:22,708 INFO L175 Difference]: Start difference. First operand has 77 places, 77 transitions, 190 flow. Second operand 9 states and 442 transitions. [2025-03-09 01:20:22,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 303 flow [2025-03-09 01:20:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:22,710 INFO L231 Difference]: Finished difference. Result has 82 places, 83 transitions, 242 flow [2025-03-09 01:20:22,710 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=82, PETRI_TRANSITIONS=83} [2025-03-09 01:20:22,711 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-03-09 01:20:22,711 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 83 transitions, 242 flow [2025-03-09 01:20:22,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 45.61538461538461) internal successors, (593), 13 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-09 01:20:22,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:22,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:22,720 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-09 01:20:22,916 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-09 01:20:22,916 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:22,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1035691572, now seen corresponding path program 1 times [2025-03-09 01:20:22,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:22,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218951182] [2025-03-09 01:20:22,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:22,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:22,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:20:22,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:22,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:22,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:22,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218951182] [2025-03-09 01:20:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218951182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:20:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730549855] [2025-03-09 01:20:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:22,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:22,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:22,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:22,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:22,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 83 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:22,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:22,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:22,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:23,071 INFO L124 PetriNetUnfolderBase]: 194/586 cut-off events. [2025-03-09 01:20:23,071 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:20:23,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 586 events. 194/586 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3517 event pairs, 113 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 904. Up to 310 conditions per place. [2025-03-09 01:20:23,074 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 41 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2025-03-09 01:20:23,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 326 flow [2025-03-09 01:20:23,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2025-03-09 01:20:23,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-03-09 01:20:23,075 INFO L175 Difference]: Start difference. First operand has 82 places, 83 transitions, 242 flow. Second operand 3 states and 168 transitions. [2025-03-09 01:20:23,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 326 flow [2025-03-09 01:20:23,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 307 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:23,077 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 225 flow [2025-03-09 01:20:23,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2025-03-09 01:20:23,077 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-03-09 01:20:23,077 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 225 flow [2025-03-09 01:20:23,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:20:23,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:23,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1035691573, now seen corresponding path program 1 times [2025-03-09 01:20:23,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014430579] [2025-03-09 01:20:23,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:20:23,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:23,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:23,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014430579] [2025-03-09 01:20:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014430579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500744217] [2025-03-09 01:20:23,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:23,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:23,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:23,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:20:23,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 01:20:23,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 01:20:23,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:20:23,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:23,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:20:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:23,325 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500744217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-09 01:20:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289712464] [2025-03-09 01:20:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:23,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:23,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:23,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:20:23,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:23,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:23,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:23,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:23,458 INFO L124 PetriNetUnfolderBase]: 195/589 cut-off events. [2025-03-09 01:20:23,458 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 01:20:23,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 589 events. 195/589 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3523 event pairs, 113 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 910. Up to 318 conditions per place. [2025-03-09 01:20:23,461 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 44 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2025-03-09 01:20:23,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 84 transitions, 329 flow [2025-03-09 01:20:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:23,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-03-09 01:20:23,462 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2025-03-09 01:20:23,462 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 225 flow. Second operand 4 states and 216 transitions. [2025-03-09 01:20:23,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 84 transitions, 329 flow [2025-03-09 01:20:23,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 84 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:23,463 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 243 flow [2025-03-09 01:20:23,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2025-03-09 01:20:23,464 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-03-09 01:20:23,464 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 243 flow [2025-03-09 01:20:23,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:23,665 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:23,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,665 INFO L85 PathProgramCache]: Analyzing trace with hash 2041670440, now seen corresponding path program 1 times [2025-03-09 01:20:23,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124512549] [2025-03-09 01:20:23,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 01:20:23,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 01:20:23,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:23,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124512549] [2025-03-09 01:20:23,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124512549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:23,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:23,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702077450] [2025-03-09 01:20:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:23,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:23,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:23,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:23,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:23,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:23,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:23,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:23,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:23,838 INFO L124 PetriNetUnfolderBase]: 194/588 cut-off events. [2025-03-09 01:20:23,838 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-09 01:20:23,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 953 conditions, 588 events. 194/588 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3504 event pairs, 113 based on Foata normal form. 1/437 useless extension candidates. Maximal degree in co-relation 910. Up to 315 conditions per place. [2025-03-09 01:20:23,841 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 42 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2025-03-09 01:20:23,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 332 flow [2025-03-09 01:20:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2025-03-09 01:20:23,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737804878048781 [2025-03-09 01:20:23,842 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 243 flow. Second operand 4 states and 221 transitions. [2025-03-09 01:20:23,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 332 flow [2025-03-09 01:20:23,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 83 transitions, 327 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:23,843 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 241 flow [2025-03-09 01:20:23,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2025-03-09 01:20:23,844 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-03-09 01:20:23,844 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 241 flow [2025-03-09 01:20:23,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:23,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:23,844 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:23,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:20:23,845 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:23,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:23,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1132785650, now seen corresponding path program 1 times [2025-03-09 01:20:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356290134] [2025-03-09 01:20:23,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:23,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:20:23,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:23,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:23,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356290134] [2025-03-09 01:20:23,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356290134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:23,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029199086] [2025-03-09 01:20:23,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:23,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:23,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:23,931 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:23,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:20:23,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:20:23,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:20:23,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:23,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:23,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:23,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:24,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 01:20:24,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029199086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:24,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:24,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:20:24,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563011632] [2025-03-09 01:20:24,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:24,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:24,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:24,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:24,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:24,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 241 flow. Second operand has 14 states, 14 states have (on average 47.785714285714285) internal successors, (669), 14 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:24,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:24,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:24,460 INFO L124 PetriNetUnfolderBase]: 377/1135 cut-off events. [2025-03-09 01:20:24,460 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-09 01:20:24,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 1135 events. 377/1135 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8177 event pairs, 225 based on Foata normal form. 1/851 useless extension candidates. Maximal degree in co-relation 905. Up to 301 conditions per place. [2025-03-09 01:20:24,466 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 58 selfloop transitions, 22 changer transitions 0/117 dead transitions. [2025-03-09 01:20:24,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 117 transitions, 505 flow [2025-03-09 01:20:24,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:24,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 530 transitions. [2025-03-09 01:20:24,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2025-03-09 01:20:24,468 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 241 flow. Second operand 10 states and 530 transitions. [2025-03-09 01:20:24,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 117 transitions, 505 flow [2025-03-09 01:20:24,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 117 transitions, 491 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:24,470 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 345 flow [2025-03-09 01:20:24,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=345, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2025-03-09 01:20:24,470 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-03-09 01:20:24,472 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 345 flow [2025-03-09 01:20:24,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 47.785714285714285) internal successors, (669), 14 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:24,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:24,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-09 01:20:24,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:24,674 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:24,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash -756614033, now seen corresponding path program 1 times [2025-03-09 01:20:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016305354] [2025-03-09 01:20:24,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:24,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 01:20:24,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 01:20:24,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:24,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016305354] [2025-03-09 01:20:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016305354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450032578] [2025-03-09 01:20:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:24,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:24,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:24,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:24,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:24,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:24,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:24,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:24,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:25,057 INFO L124 PetriNetUnfolderBase]: 384/1168 cut-off events. [2025-03-09 01:20:25,058 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-09 01:20:25,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 1168 events. 384/1168 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8429 event pairs, 226 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 927. Up to 628 conditions per place. [2025-03-09 01:20:25,065 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 55 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2025-03-09 01:20:25,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 467 flow [2025-03-09 01:20:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-03-09 01:20:25,066 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2025-03-09 01:20:25,067 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 345 flow. Second operand 4 states and 216 transitions. [2025-03-09 01:20:25,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 467 flow [2025-03-09 01:20:25,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 463 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 01:20:25,069 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 360 flow [2025-03-09 01:20:25,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2025-03-09 01:20:25,070 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 16 predicate places. [2025-03-09 01:20:25,070 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 360 flow [2025-03-09 01:20:25,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:25,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:25,071 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:25,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 01:20:25,071 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:25,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 767891730, now seen corresponding path program 2 times [2025-03-09 01:20:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165940548] [2025-03-09 01:20:25,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:25,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:20:25,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:20:25,092 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:25,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:25,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165940548] [2025-03-09 01:20:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165940548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:25,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415199318] [2025-03-09 01:20:25,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:25,208 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:25,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:20:25,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 01:20:25,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 01:20:25,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:25,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:25,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 01:20:25,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:25,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:20:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:25,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:25,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415199318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:25,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:25,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 12 [2025-03-09 01:20:25,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149705645] [2025-03-09 01:20:25,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:25,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:25,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:25,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:25,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:25,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 360 flow. Second operand has 14 states, 14 states have (on average 46.142857142857146) internal successors, (646), 14 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:25,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:25,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:25,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:26,059 INFO L124 PetriNetUnfolderBase]: 384/1167 cut-off events. [2025-03-09 01:20:26,059 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-09 01:20:26,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 1167 events. 384/1167 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8414 event pairs, 226 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 930. Up to 615 conditions per place. [2025-03-09 01:20:26,085 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 41 selfloop transitions, 17 changer transitions 0/93 dead transitions. [2025-03-09 01:20:26,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 476 flow [2025-03-09 01:20:26,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 394 transitions. [2025-03-09 01:20:26,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.600609756097561 [2025-03-09 01:20:26,087 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 360 flow. Second operand 8 states and 394 transitions. [2025-03-09 01:20:26,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 476 flow [2025-03-09 01:20:26,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:26,091 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 389 flow [2025-03-09 01:20:26,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=389, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-03-09 01:20:26,092 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2025-03-09 01:20:26,092 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 389 flow [2025-03-09 01:20:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.142857142857146) internal successors, (646), 14 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:26,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:26,092 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:26,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:20:26,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1256585574, now seen corresponding path program 1 times [2025-03-09 01:20:26,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:26,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634125639] [2025-03-09 01:20:26,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:26,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:20:26,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:20:26,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:26,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:26,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:26,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:26,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634125639] [2025-03-09 01:20:26,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634125639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:26,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309468090] [2025-03-09 01:20:26,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:26,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:26,444 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:26,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:20:26,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 01:20:26,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 01:20:26,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:26,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:26,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:26,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:26,563 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:26,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 01:20:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309468090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:26,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:26,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-09 01:20:26,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297357134] [2025-03-09 01:20:26,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:26,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:26,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:26,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:26,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:26,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:26,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 389 flow. Second operand has 14 states, 14 states have (on average 48.0) internal successors, (672), 14 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:26,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:26,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:26,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:26,994 INFO L124 PetriNetUnfolderBase]: 745/2245 cut-off events. [2025-03-09 01:20:26,994 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-09 01:20:26,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3627 conditions, 2245 events. 745/2245 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19059 event pairs, 450 based on Foata normal form. 2/1685 useless extension candidates. Maximal degree in co-relation 1790. Up to 596 conditions per place. [2025-03-09 01:20:27,004 INFO L140 encePairwiseOnDemand]: 71/82 looper letters, 66 selfloop transitions, 22 changer transitions 0/124 dead transitions. [2025-03-09 01:20:27,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 124 transitions, 676 flow [2025-03-09 01:20:27,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 436 transitions. [2025-03-09 01:20:27,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6646341463414634 [2025-03-09 01:20:27,006 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 389 flow. Second operand 8 states and 436 transitions. [2025-03-09 01:20:27,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 124 transitions, 676 flow [2025-03-09 01:20:27,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 124 transitions, 600 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:27,008 INFO L231 Difference]: Finished difference. Result has 101 places, 97 transitions, 422 flow [2025-03-09 01:20:27,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=422, PETRI_PLACES=101, PETRI_TRANSITIONS=97} [2025-03-09 01:20:27,009 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-03-09 01:20:27,009 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 422 flow [2025-03-09 01:20:27,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 48.0) internal successors, (672), 14 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:27,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:27,009 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:27,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:27,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:27,215 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:27,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:27,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1162455472, now seen corresponding path program 2 times [2025-03-09 01:20:27,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:27,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996569479] [2025-03-09 01:20:27,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:27,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:27,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:20:27,234 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:27,235 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:27,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:27,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996569479] [2025-03-09 01:20:27,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996569479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:27,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996349334] [2025-03-09 01:20:27,354 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:27,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:27,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:27,356 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:27,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:20:27,403 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-09 01:20:27,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:27,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:27,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:27,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 01:20:27,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:27,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-09 01:20:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-09 01:20:27,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:27,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996349334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:27,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:27,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 12 [2025-03-09 01:20:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721927723] [2025-03-09 01:20:27,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:27,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:27,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:27,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:27,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:27,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 422 flow. Second operand has 14 states, 14 states have (on average 46.57142857142857) internal successors, (652), 14 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-09 01:20:27,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:27,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:27,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:28,180 INFO L124 PetriNetUnfolderBase]: 759/2301 cut-off events. [2025-03-09 01:20:28,180 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-09 01:20:28,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3701 conditions, 2301 events. 759/2301 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 19520 event pairs, 452 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 1820. Up to 1207 conditions per place. [2025-03-09 01:20:28,192 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 45 selfloop transitions, 17 changer transitions 0/97 dead transitions. [2025-03-09 01:20:28,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 97 transitions, 546 flow [2025-03-09 01:20:28,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 01:20:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 01:20:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 393 transitions. [2025-03-09 01:20:28,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5990853658536586 [2025-03-09 01:20:28,194 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 422 flow. Second operand 8 states and 393 transitions. [2025-03-09 01:20:28,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 97 transitions, 546 flow [2025-03-09 01:20:28,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 97 transitions, 520 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:28,196 INFO L231 Difference]: Finished difference. Result has 105 places, 97 transitions, 430 flow [2025-03-09 01:20:28,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=430, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2025-03-09 01:20:28,196 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2025-03-09 01:20:28,196 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 430 flow [2025-03-09 01:20:28,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.57142857142857) internal successors, (652), 14 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-09 01:20:28,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:28,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:28,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:28,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:28,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:28,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash -692811241, now seen corresponding path program 1 times [2025-03-09 01:20:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657573520] [2025-03-09 01:20:28,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:28,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:28,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:28,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 01:20:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657573520] [2025-03-09 01:20:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657573520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:28,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:28,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:20:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142037083] [2025-03-09 01:20:28,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:28,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:28,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:28,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:28,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-03-09 01:20:28,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 97 transitions, 430 flow. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:28,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:28,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-03-09 01:20:28,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:28,808 INFO L124 PetriNetUnfolderBase]: 847/2321 cut-off events. [2025-03-09 01:20:28,809 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-09 01:20:28,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3881 conditions, 2321 events. 847/2321 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 18991 event pairs, 524 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 1911. Up to 1352 conditions per place. [2025-03-09 01:20:28,821 INFO L140 encePairwiseOnDemand]: 75/82 looper letters, 56 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2025-03-09 01:20:28,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 548 flow [2025-03-09 01:20:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2025-03-09 01:20:28,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707317073170731 [2025-03-09 01:20:28,822 INFO L175 Difference]: Start difference. First operand has 105 places, 97 transitions, 430 flow. Second operand 5 states and 234 transitions. [2025-03-09 01:20:28,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 548 flow [2025-03-09 01:20:28,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 496 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:28,824 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 384 flow [2025-03-09 01:20:28,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-03-09 01:20:28,825 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 20 predicate places. [2025-03-09 01:20:28,825 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 384 flow [2025-03-09 01:20:28,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:28,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:28,826 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:28,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 01:20:28,827 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:28,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash -692811240, now seen corresponding path program 1 times [2025-03-09 01:20:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:28,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107896703] [2025-03-09 01:20:28,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:28,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:28,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:28,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:28,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:29,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107896703] [2025-03-09 01:20:29,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107896703] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:29,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309703432] [2025-03-09 01:20:29,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:29,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:29,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:29,127 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:29,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:20:29,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 01:20:29,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 01:20:29,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:29,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:20:29,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:29,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:29,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:29,275 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 19 treesize of output 14 [2025-03-09 01:20:29,294 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-09 01:20:29,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-09 01:20:29,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:29,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 01:20:29,384 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-09 01:20:29,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-09 01:20:29,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:29,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-03-09 01:20:29,432 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-09 01:20:29,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-09 01:20:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:29,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309703432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-09 01:20:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233376468] [2025-03-09 01:20:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:29,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:20:29,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:29,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:20:29,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:29,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 82 [2025-03-09 01:20:29,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:29,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:29,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 82 [2025-03-09 01:20:29,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:29,798 INFO L124 PetriNetUnfolderBase]: 759/2069 cut-off events. [2025-03-09 01:20:29,798 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 01:20:29,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3445 conditions, 2069 events. 759/2069 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16237 event pairs, 452 based on Foata normal form. 80/1715 useless extension candidates. Maximal degree in co-relation 1694. Up to 1222 conditions per place. [2025-03-09 01:20:29,809 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 59 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2025-03-09 01:20:29,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 500 flow [2025-03-09 01:20:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-03-09 01:20:29,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5548780487804879 [2025-03-09 01:20:29,811 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 384 flow. Second operand 4 states and 182 transitions. [2025-03-09 01:20:29,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 500 flow [2025-03-09 01:20:29,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 490 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:29,814 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 372 flow [2025-03-09 01:20:29,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-03-09 01:20:29,814 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 16 predicate places. [2025-03-09 01:20:29,815 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 372 flow [2025-03-09 01:20:29,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:29,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:29,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:29,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:20:30,015 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,SelfDestructingSolverStorable14 [2025-03-09 01:20:30,016 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:30,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2311088, now seen corresponding path program 1 times [2025-03-09 01:20:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:30,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241730686] [2025-03-09 01:20:30,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:30,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:30,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:30,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:20:30,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:30,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241730686] [2025-03-09 01:20:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241730686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250811861] [2025-03-09 01:20:30,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:30,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:30,120 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:30,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 01:20:30,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:30,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:30,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 01:20:30,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:30,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:30,219 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:20:30,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:20:30,232 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:20:30,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:20:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:20:30,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:20:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250811861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:30,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:20:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2025-03-09 01:20:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075425432] [2025-03-09 01:20:30,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:30,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:30,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:30,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:30,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 82 [2025-03-09 01:20:30,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 372 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:30,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:30,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 82 [2025-03-09 01:20:30,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:30,427 INFO L124 PetriNetUnfolderBase]: 863/2085 cut-off events. [2025-03-09 01:20:30,427 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-09 01:20:30,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3625 conditions, 2085 events. 863/2085 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15290 event pairs, 532 based on Foata normal form. 0/1831 useless extension candidates. Maximal degree in co-relation 1784. Up to 1372 conditions per place. [2025-03-09 01:20:30,434 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 58 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2025-03-09 01:20:30,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 490 flow [2025-03-09 01:20:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:30,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-03-09 01:20:30,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945121951219512 [2025-03-09 01:20:30,436 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 372 flow. Second operand 4 states and 195 transitions. [2025-03-09 01:20:30,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 490 flow [2025-03-09 01:20:30,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:30,439 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 370 flow [2025-03-09 01:20:30,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=370, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2025-03-09 01:20:30,440 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-03-09 01:20:30,440 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 370 flow [2025-03-09 01:20:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:30,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:30,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:30,447 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-09 01:20:30,644 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,SelfDestructingSolverStorable15 [2025-03-09 01:20:30,644 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:30,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:30,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2311087, now seen corresponding path program 1 times [2025-03-09 01:20:30,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:30,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644863337] [2025-03-09 01:20:30,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:30,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:30,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:30,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:30,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644863337] [2025-03-09 01:20:30,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644863337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:30,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831869506] [2025-03-09 01:20:30,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:30,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:30,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:30,908 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:30,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:20:30,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 01:20:30,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 01:20:30,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:30,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:30,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 01:20:30,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:30,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:31,045 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-09 01:20:31,045 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 19 treesize of output 18 [2025-03-09 01:20:31,060 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-09 01:20:31,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-09 01:20:31,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:31,108 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 19 treesize of output 14 [2025-03-09 01:20:31,113 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:31,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:20:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:20:31,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:31,310 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 188 treesize of output 182 [2025-03-09 01:20:31,449 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:31,449 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 102 treesize of output 100 [2025-03-09 01:20:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 01:20:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831869506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:31,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:31,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2025-03-09 01:20:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588132421] [2025-03-09 01:20:31,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:31,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 01:20:31,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:31,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 01:20:31,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:20:32,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 82 [2025-03-09 01:20:32,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 370 flow. Second operand has 16 states, 16 states have (on average 35.625) internal successors, (570), 16 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:32,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:32,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 82 [2025-03-09 01:20:32,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:32,370 INFO L124 PetriNetUnfolderBase]: 863/1961 cut-off events. [2025-03-09 01:20:32,370 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 01:20:32,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3505 conditions, 1961 events. 863/1961 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13666 event pairs, 532 based on Foata normal form. 0/1707 useless extension candidates. Maximal degree in co-relation 1724. Up to 1340 conditions per place. [2025-03-09 01:20:32,375 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 49 selfloop transitions, 14 changer transitions 0/81 dead transitions. [2025-03-09 01:20:32,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 81 transitions, 488 flow [2025-03-09 01:20:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 01:20:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 01:20:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 271 transitions. [2025-03-09 01:20:32,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4721254355400697 [2025-03-09 01:20:32,376 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 370 flow. Second operand 7 states and 271 transitions. [2025-03-09 01:20:32,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 81 transitions, 488 flow [2025-03-09 01:20:32,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 81 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:32,378 INFO L231 Difference]: Finished difference. Result has 91 places, 81 transitions, 384 flow [2025-03-09 01:20:32,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=384, PETRI_PLACES=91, PETRI_TRANSITIONS=81} [2025-03-09 01:20:32,379 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-03-09 01:20:32,379 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 384 flow [2025-03-09 01:20:32,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 35.625) internal successors, (570), 16 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:32,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:32,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:32,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:20:32,584 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,SelfDestructingSolverStorable16 [2025-03-09 01:20:32,584 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:32,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash -71642822, now seen corresponding path program 1 times [2025-03-09 01:20:32,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:32,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858774907] [2025-03-09 01:20:32,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:32,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:32,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:32,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:32,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858774907] [2025-03-09 01:20:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858774907] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195012615] [2025-03-09 01:20:32,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:32,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:32,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:32,650 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:32,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 01:20:32,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:32,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:32,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:32,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:32,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:20:32,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:32,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:32,743 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-09 01:20:32,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-09 01:20:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:20:32,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:20:32,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195012615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:32,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:32,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-03-09 01:20:32,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465887851] [2025-03-09 01:20:32,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:32,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:20:32,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:32,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:20:32,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:20:32,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-03-09 01:20:32,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:32,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:32,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-03-09 01:20:32,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:32,960 INFO L124 PetriNetUnfolderBase]: 759/1773 cut-off events. [2025-03-09 01:20:32,960 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-09 01:20:32,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3168 conditions, 1773 events. 759/1773 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 12213 event pairs, 452 based on Foata normal form. 0/1577 useless extension candidates. Maximal degree in co-relation 1552. Up to 1176 conditions per place. [2025-03-09 01:20:32,964 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 52 selfloop transitions, 10 changer transitions 0/79 dead transitions. [2025-03-09 01:20:32,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 79 transitions, 504 flow [2025-03-09 01:20:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:20:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 01:20:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 246 transitions. [2025-03-09 01:20:32,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 01:20:32,966 INFO L175 Difference]: Start difference. First operand has 91 places, 81 transitions, 384 flow. Second operand 5 states and 246 transitions. [2025-03-09 01:20:32,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 79 transitions, 504 flow [2025-03-09 01:20:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 79 transitions, 478 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:32,967 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 374 flow [2025-03-09 01:20:32,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2025-03-09 01:20:32,968 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2025-03-09 01:20:32,968 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 374 flow [2025-03-09 01:20:32,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:32,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:32,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:32,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 01:20:33,172 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,SelfDestructingSolverStorable17 [2025-03-09 01:20:33,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:33,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:33,172 INFO L85 PathProgramCache]: Analyzing trace with hash -71642821, now seen corresponding path program 1 times [2025-03-09 01:20:33,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:33,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810259386] [2025-03-09 01:20:33,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:33,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:33,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:33,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:33,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810259386] [2025-03-09 01:20:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810259386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551621023] [2025-03-09 01:20:33,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:33,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:33,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:33,329 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:33,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 01:20:33,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:20:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:20:33,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:33,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:20:33,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:33,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:33,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-09 01:20:33,491 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:33,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:20:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:33,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:33,601 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 53 treesize of output 49 [2025-03-09 01:20:33,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 01:20:33,656 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 32 treesize of output 37 [2025-03-09 01:20:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:33,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551621023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:33,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:33,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-09 01:20:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505845748] [2025-03-09 01:20:33,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:33,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 01:20:33,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:33,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 01:20:33,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:20:34,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-03-09 01:20:34,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 374 flow. Second operand has 18 states, 18 states have (on average 44.611111111111114) internal successors, (803), 18 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:34,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:34,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-03-09 01:20:34,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:34,917 INFO L124 PetriNetUnfolderBase]: 881/2049 cut-off events. [2025-03-09 01:20:34,917 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-09 01:20:34,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3666 conditions, 2049 events. 881/2049 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14606 event pairs, 374 based on Foata normal form. 0/1793 useless extension candidates. Maximal degree in co-relation 2086. Up to 588 conditions per place. [2025-03-09 01:20:34,923 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 77 selfloop transitions, 29 changer transitions 0/121 dead transitions. [2025-03-09 01:20:34,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 121 transitions, 695 flow [2025-03-09 01:20:34,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 01:20:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 01:20:34,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 636 transitions. [2025-03-09 01:20:34,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5966228893058161 [2025-03-09 01:20:34,925 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 374 flow. Second operand 13 states and 636 transitions. [2025-03-09 01:20:34,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 121 transitions, 695 flow [2025-03-09 01:20:34,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 121 transitions, 675 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:34,927 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 486 flow [2025-03-09 01:20:34,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=486, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2025-03-09 01:20:34,928 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 24 predicate places. [2025-03-09 01:20:34,928 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 486 flow [2025-03-09 01:20:34,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 44.611111111111114) internal successors, (803), 18 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:34,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:34,929 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:34,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:20:35,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:35,129 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:35,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash -313959497, now seen corresponding path program 2 times [2025-03-09 01:20:35,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:35,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992043960] [2025-03-09 01:20:35,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:35,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:35,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:20:35,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:35,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:35,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:35,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992043960] [2025-03-09 01:20:35,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992043960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:35,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402212247] [2025-03-09 01:20:35,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:35,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:35,223 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:35,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 01:20:35,279 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-09 01:20:35,300 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:35,300 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:35,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:35,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:35,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:35,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402212247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:35,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:35,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-09 01:20:35,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995702796] [2025-03-09 01:20:35,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:35,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:35,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:35,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:35,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:35,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:35,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 486 flow. Second operand has 14 states, 14 states have (on average 48.357142857142854) internal successors, (677), 14 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:35,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:35,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:35,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:35,764 INFO L124 PetriNetUnfolderBase]: 827/1915 cut-off events. [2025-03-09 01:20:35,764 INFO L125 PetriNetUnfolderBase]: For 292/316 co-relation queries the response was YES. [2025-03-09 01:20:35,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 1915 events. 827/1915 cut-off events. For 292/316 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13178 event pairs, 508 based on Foata normal form. 2/1717 useless extension candidates. Maximal degree in co-relation 2210. Up to 726 conditions per place. [2025-03-09 01:20:35,769 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 72 selfloop transitions, 23 changer transitions 0/112 dead transitions. [2025-03-09 01:20:35,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 112 transitions, 742 flow [2025-03-09 01:20:35,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 533 transitions. [2025-03-09 01:20:35,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-03-09 01:20:35,771 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 486 flow. Second operand 10 states and 533 transitions. [2025-03-09 01:20:35,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 112 transitions, 742 flow [2025-03-09 01:20:35,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 112 transitions, 698 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-09 01:20:35,774 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 534 flow [2025-03-09 01:20:35,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=534, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2025-03-09 01:20:35,774 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2025-03-09 01:20:35,774 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 534 flow [2025-03-09 01:20:35,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 48.357142857142854) internal successors, (677), 14 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:35,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:35,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:35,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 01:20:35,975 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,SelfDestructingSolverStorable19 [2025-03-09 01:20:35,975 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:35,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2118879758, now seen corresponding path program 1 times [2025-03-09 01:20:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926727721] [2025-03-09 01:20:35,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:35,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:20:35,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:35,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:35,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-09 01:20:36,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:36,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926727721] [2025-03-09 01:20:36,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926727721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:36,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:36,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:36,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544460101] [2025-03-09 01:20:36,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:36,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:20:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:36,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:20:36,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:20:36,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-03-09 01:20:36,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:36,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:36,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-03-09 01:20:36,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:36,180 INFO L124 PetriNetUnfolderBase]: 817/1849 cut-off events. [2025-03-09 01:20:36,180 INFO L125 PetriNetUnfolderBase]: For 276/296 co-relation queries the response was YES. [2025-03-09 01:20:36,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3671 conditions, 1849 events. 817/1849 cut-off events. For 276/296 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12266 event pairs, 492 based on Foata normal form. 0/1713 useless extension candidates. Maximal degree in co-relation 2196. Up to 1284 conditions per place. [2025-03-09 01:20:36,188 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 66 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2025-03-09 01:20:36,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 89 transitions, 678 flow [2025-03-09 01:20:36,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:20:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 01:20:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2025-03-09 01:20:36,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6219512195121951 [2025-03-09 01:20:36,189 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 534 flow. Second operand 4 states and 204 transitions. [2025-03-09 01:20:36,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 89 transitions, 678 flow [2025-03-09 01:20:36,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 89 transitions, 650 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:36,191 INFO L231 Difference]: Finished difference. Result has 103 places, 89 transitions, 518 flow [2025-03-09 01:20:36,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=518, PETRI_PLACES=103, PETRI_TRANSITIONS=89} [2025-03-09 01:20:36,192 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 25 predicate places. [2025-03-09 01:20:36,192 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 518 flow [2025-03-09 01:20:36,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:36,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:36,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:36,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 01:20:36,192 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:36,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2118879757, now seen corresponding path program 1 times [2025-03-09 01:20:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:36,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981996753] [2025-03-09 01:20:36,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:36,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:36,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:20:36,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:36,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:36,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:36,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:36,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981996753] [2025-03-09 01:20:36,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981996753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:36,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916753467] [2025-03-09 01:20:36,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:36,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:36,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:36,359 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:36,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 01:20:36,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 01:20:36,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 01:20:36,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:36,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:36,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 01:20:36,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:36,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:36,583 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 23 treesize of output 19 [2025-03-09 01:20:36,634 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916753467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:36,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:36,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-09 01:20:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878540740] [2025-03-09 01:20:36,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:36,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 01:20:36,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:36,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 01:20:36,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:20:36,997 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:36,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 518 flow. Second operand has 19 states, 19 states have (on average 46.473684210526315) internal successors, (883), 19 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:36,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:36,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:36,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:37,309 INFO L124 PetriNetUnfolderBase]: 953/2095 cut-off events. [2025-03-09 01:20:37,309 INFO L125 PetriNetUnfolderBase]: For 297/320 co-relation queries the response was YES. [2025-03-09 01:20:37,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 2095 events. 953/2095 cut-off events. For 297/320 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14150 event pairs, 404 based on Foata normal form. 0/1913 useless extension candidates. Maximal degree in co-relation 2442. Up to 642 conditions per place. [2025-03-09 01:20:37,317 INFO L140 encePairwiseOnDemand]: 67/82 looper letters, 96 selfloop transitions, 28 changer transitions 0/137 dead transitions. [2025-03-09 01:20:37,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 137 transitions, 922 flow [2025-03-09 01:20:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:20:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 01:20:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 573 transitions. [2025-03-09 01:20:37,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6352549889135255 [2025-03-09 01:20:37,318 INFO L175 Difference]: Start difference. First operand has 103 places, 89 transitions, 518 flow. Second operand 11 states and 573 transitions. [2025-03-09 01:20:37,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 137 transitions, 922 flow [2025-03-09 01:20:37,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 910 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:37,321 INFO L231 Difference]: Finished difference. Result has 115 places, 93 transitions, 618 flow [2025-03-09 01:20:37,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=618, PETRI_PLACES=115, PETRI_TRANSITIONS=93} [2025-03-09 01:20:37,322 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 37 predicate places. [2025-03-09 01:20:37,322 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 93 transitions, 618 flow [2025-03-09 01:20:37,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 46.473684210526315) internal successors, (883), 19 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:37,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:37,323 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:37,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 01:20:37,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:37,526 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:37,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:37,526 INFO L85 PathProgramCache]: Analyzing trace with hash -102758658, now seen corresponding path program 3 times [2025-03-09 01:20:37,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:37,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785028443] [2025-03-09 01:20:37,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:37,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 5 equivalence classes. [2025-03-09 01:20:37,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 22 statements. [2025-03-09 01:20:37,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:20:37,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-09 01:20:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785028443] [2025-03-09 01:20:37,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785028443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:37,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390376580] [2025-03-09 01:20:37,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:37,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:37,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:37,820 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:37,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 01:20:37,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 5 equivalence classes. [2025-03-09 01:20:37,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 20 of 22 statements. [2025-03-09 01:20:37,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 01:20:37,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:37,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:20:37,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:38,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:38,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-09 01:20:38,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:20:38,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-09 01:20:38,048 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-09 01:20:38,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-09 01:20:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:20:38,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:38,177 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 01:20:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:20:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390376580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:38,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:38,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2025-03-09 01:20:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875524533] [2025-03-09 01:20:38,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:38,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-09 01:20:38,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:38,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-09 01:20:38,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-09 01:20:39,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 82 [2025-03-09 01:20:39,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 93 transitions, 618 flow. Second operand has 23 states, 23 states have (on average 44.47826086956522) internal successors, (1023), 23 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:39,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:39,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 82 [2025-03-09 01:20:39,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:39,841 INFO L124 PetriNetUnfolderBase]: 1335/2926 cut-off events. [2025-03-09 01:20:39,841 INFO L125 PetriNetUnfolderBase]: For 920/939 co-relation queries the response was YES. [2025-03-09 01:20:39,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6204 conditions, 2926 events. 1335/2926 cut-off events. For 920/939 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 20944 event pairs, 837 based on Foata normal form. 80/2815 useless extension candidates. Maximal degree in co-relation 4436. Up to 1394 conditions per place. [2025-03-09 01:20:39,851 INFO L140 encePairwiseOnDemand]: 74/82 looper letters, 111 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-03-09 01:20:39,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 143 transitions, 1185 flow [2025-03-09 01:20:39,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:20:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-09 01:20:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 580 transitions. [2025-03-09 01:20:39,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5894308943089431 [2025-03-09 01:20:39,852 INFO L175 Difference]: Start difference. First operand has 115 places, 93 transitions, 618 flow. Second operand 12 states and 580 transitions. [2025-03-09 01:20:39,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 143 transitions, 1185 flow [2025-03-09 01:20:39,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 143 transitions, 1143 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:39,858 INFO L231 Difference]: Finished difference. Result has 118 places, 97 transitions, 689 flow [2025-03-09 01:20:39,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=689, PETRI_PLACES=118, PETRI_TRANSITIONS=97} [2025-03-09 01:20:39,859 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 40 predicate places. [2025-03-09 01:20:39,859 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 97 transitions, 689 flow [2025-03-09 01:20:39,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 44.47826086956522) internal successors, (1023), 23 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:39,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:39,859 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:39,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 01:20:40,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:40,060 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:40,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:40,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1975016151, now seen corresponding path program 2 times [2025-03-09 01:20:40,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:40,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798617408] [2025-03-09 01:20:40,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:40,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:40,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:20:40,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:20:40,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:40,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:40,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798617408] [2025-03-09 01:20:40,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798617408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:40,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466515854] [2025-03-09 01:20:40,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:40,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:40,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:40,149 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:40,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 01:20:40,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 01:20:40,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:20:40,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:20:40,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:40,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:20:40,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:40,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 01:20:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466515854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:40,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-09 01:20:40,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319242316] [2025-03-09 01:20:40,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:40,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 01:20:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:40,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 01:20:40,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-09 01:20:40,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:40,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 97 transitions, 689 flow. Second operand has 14 states, 14 states have (on average 48.5) internal successors, (679), 14 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:40,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:40,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:40,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:40,757 INFO L124 PetriNetUnfolderBase]: 1337/2926 cut-off events. [2025-03-09 01:20:40,757 INFO L125 PetriNetUnfolderBase]: For 604/631 co-relation queries the response was YES. [2025-03-09 01:20:40,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 2926 events. 1337/2926 cut-off events. For 604/631 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20760 event pairs, 829 based on Foata normal form. 3/2740 useless extension candidates. Maximal degree in co-relation 3754. Up to 1204 conditions per place. [2025-03-09 01:20:40,767 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 75 selfloop transitions, 44 changer transitions 0/132 dead transitions. [2025-03-09 01:20:40,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 132 transitions, 1058 flow [2025-03-09 01:20:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:40,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 530 transitions. [2025-03-09 01:20:40,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6463414634146342 [2025-03-09 01:20:40,768 INFO L175 Difference]: Start difference. First operand has 118 places, 97 transitions, 689 flow. Second operand 10 states and 530 transitions. [2025-03-09 01:20:40,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 132 transitions, 1058 flow [2025-03-09 01:20:40,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 132 transitions, 1049 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 01:20:40,772 INFO L231 Difference]: Finished difference. Result has 126 places, 109 transitions, 889 flow [2025-03-09 01:20:40,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=889, PETRI_PLACES=126, PETRI_TRANSITIONS=109} [2025-03-09 01:20:40,772 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2025-03-09 01:20:40,772 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 109 transitions, 889 flow [2025-03-09 01:20:40,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 48.5) internal successors, (679), 14 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:40,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:40,773 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:20:40,779 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-09 01:20:40,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 01:20:40,973 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:40,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1143487232, now seen corresponding path program 1 times [2025-03-09 01:20:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:40,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229633617] [2025-03-09 01:20:40,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:40,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:20:40,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:40,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:40,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-09 01:20:41,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229633617] [2025-03-09 01:20:41,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229633617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:20:41,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998377393] [2025-03-09 01:20:41,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:41,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:41,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:20:41,152 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:20:41,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 01:20:41,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 01:20:41,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 01:20:41,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:41,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:41,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-09 01:20:41,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:20:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:41,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:20:41,448 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 23 treesize of output 19 [2025-03-09 01:20:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 01:20:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998377393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:20:41,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:20:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 24 [2025-03-09 01:20:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123449804] [2025-03-09 01:20:41,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:20:41,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 01:20:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:41,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 01:20:41,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2025-03-09 01:20:42,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 82 [2025-03-09 01:20:42,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 109 transitions, 889 flow. Second operand has 25 states, 25 states have (on average 46.4) internal successors, (1160), 25 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:42,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:42,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 82 [2025-03-09 01:20:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:42,976 INFO L124 PetriNetUnfolderBase]: 1990/4240 cut-off events. [2025-03-09 01:20:42,976 INFO L125 PetriNetUnfolderBase]: For 1153/1153 co-relation queries the response was YES. [2025-03-09 01:20:42,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9104 conditions, 4240 events. 1990/4240 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 31582 event pairs, 1247 based on Foata normal form. 126/4107 useless extension candidates. Maximal degree in co-relation 6651. Up to 1113 conditions per place. [2025-03-09 01:20:42,986 INFO L140 encePairwiseOnDemand]: 69/82 looper letters, 121 selfloop transitions, 55 changer transitions 0/187 dead transitions. [2025-03-09 01:20:42,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 187 transitions, 1689 flow [2025-03-09 01:20:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-09 01:20:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-09 01:20:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1122 transitions. [2025-03-09 01:20:42,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5949098621420997 [2025-03-09 01:20:42,988 INFO L175 Difference]: Start difference. First operand has 126 places, 109 transitions, 889 flow. Second operand 23 states and 1122 transitions. [2025-03-09 01:20:42,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 187 transitions, 1689 flow [2025-03-09 01:20:42,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 187 transitions, 1622 flow, removed 14 selfloop flow, removed 7 redundant places. [2025-03-09 01:20:42,993 INFO L231 Difference]: Finished difference. Result has 143 places, 124 transitions, 1151 flow [2025-03-09 01:20:42,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1151, PETRI_PLACES=143, PETRI_TRANSITIONS=124} [2025-03-09 01:20:42,994 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 65 predicate places. [2025-03-09 01:20:42,994 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 124 transitions, 1151 flow [2025-03-09 01:20:42,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 46.4) internal successors, (1160), 25 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:42,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:42,995 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, 1, 1, 1] [2025-03-09 01:20:43,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-09 01:20:43,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:20:43,199 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:43,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1612315122, now seen corresponding path program 1 times [2025-03-09 01:20:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:43,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846445572] [2025-03-09 01:20:43,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:43,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 01:20:43,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 01:20:43,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:43,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846445572] [2025-03-09 01:20:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846445572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:43,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011585006] [2025-03-09 01:20:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:43,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:43,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:43,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:43,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 82 [2025-03-09 01:20:43,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 124 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-09 01:20:43,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:43,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 82 [2025-03-09 01:20:43,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:43,598 INFO L124 PetriNetUnfolderBase]: 2992/5742 cut-off events. [2025-03-09 01:20:43,598 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2025-03-09 01:20:43,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12573 conditions, 5742 events. 2992/5742 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 40798 event pairs, 1456 based on Foata normal form. 0/5291 useless extension candidates. Maximal degree in co-relation 8217. Up to 3506 conditions per place. [2025-03-09 01:20:43,618 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 126 selfloop transitions, 3 changer transitions 0/137 dead transitions. [2025-03-09 01:20:43,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 137 transitions, 1443 flow [2025-03-09 01:20:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2025-03-09 01:20:43,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7276422764227642 [2025-03-09 01:20:43,619 INFO L175 Difference]: Start difference. First operand has 143 places, 124 transitions, 1151 flow. Second operand 3 states and 179 transitions. [2025-03-09 01:20:43,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 137 transitions, 1443 flow [2025-03-09 01:20:43,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 137 transitions, 1367 flow, removed 2 selfloop flow, removed 12 redundant places. [2025-03-09 01:20:43,624 INFO L231 Difference]: Finished difference. Result has 135 places, 126 transitions, 1097 flow [2025-03-09 01:20:43,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=135, PETRI_TRANSITIONS=126} [2025-03-09 01:20:43,625 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 57 predicate places. [2025-03-09 01:20:43,625 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 126 transitions, 1097 flow [2025-03-09 01:20:43,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 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-09 01:20:43,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:43,625 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, 1, 1, 1, 1] [2025-03-09 01:20:43,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 01:20:43,625 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:43,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash 727918196, now seen corresponding path program 1 times [2025-03-09 01:20:43,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:43,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036536847] [2025-03-09 01:20:43,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:43,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:43,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 01:20:43,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 01:20:43,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:43,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036536847] [2025-03-09 01:20:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036536847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:43,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:43,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:20:43,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212113038] [2025-03-09 01:20:43,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:43,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:20:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:43,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:20:43,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:20:43,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 82 [2025-03-09 01:20:43,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 126 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:43,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:43,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 82 [2025-03-09 01:20:43,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:44,149 INFO L124 PetriNetUnfolderBase]: 3187/6042 cut-off events. [2025-03-09 01:20:44,149 INFO L125 PetriNetUnfolderBase]: For 1684/1808 co-relation queries the response was YES. [2025-03-09 01:20:44,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14623 conditions, 6042 events. 3187/6042 cut-off events. For 1684/1808 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 43137 event pairs, 1698 based on Foata normal form. 124/5759 useless extension candidates. Maximal degree in co-relation 10919. Up to 3877 conditions per place. [2025-03-09 01:20:44,168 INFO L140 encePairwiseOnDemand]: 78/82 looper letters, 127 selfloop transitions, 3 changer transitions 0/139 dead transitions. [2025-03-09 01:20:44,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 1399 flow [2025-03-09 01:20:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:20:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 01:20:44,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2025-03-09 01:20:44,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7235772357723578 [2025-03-09 01:20:44,169 INFO L175 Difference]: Start difference. First operand has 135 places, 126 transitions, 1097 flow. Second operand 3 states and 178 transitions. [2025-03-09 01:20:44,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 1399 flow [2025-03-09 01:20:44,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 1391 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:44,187 INFO L231 Difference]: Finished difference. Result has 137 places, 128 transitions, 1113 flow [2025-03-09 01:20:44,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=137, PETRI_TRANSITIONS=128} [2025-03-09 01:20:44,188 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 59 predicate places. [2025-03-09 01:20:44,188 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 128 transitions, 1113 flow [2025-03-09 01:20:44,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:44,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:44,188 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, 1, 1, 1, 1, 1] [2025-03-09 01:20:44,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-09 01:20:44,188 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1773488084, now seen corresponding path program 1 times [2025-03-09 01:20:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:44,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476251116] [2025-03-09 01:20:44,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:20:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:44,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:20:44,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:20:44,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:20:44,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:44,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476251116] [2025-03-09 01:20:44,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476251116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:44,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:44,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192828520] [2025-03-09 01:20:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:44,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:44,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:44,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:44,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:44,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:44,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 128 transitions, 1113 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:44,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:44,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:44,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:46,279 INFO L124 PetriNetUnfolderBase]: 7161/14660 cut-off events. [2025-03-09 01:20:46,279 INFO L125 PetriNetUnfolderBase]: For 5057/5534 co-relation queries the response was YES. [2025-03-09 01:20:46,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36543 conditions, 14660 events. 7161/14660 cut-off events. For 5057/5534 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 135631 event pairs, 480 based on Foata normal form. 486/14945 useless extension candidates. Maximal degree in co-relation 26799. Up to 3405 conditions per place. [2025-03-09 01:20:46,339 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 202 selfloop transitions, 6 changer transitions 7/228 dead transitions. [2025-03-09 01:20:46,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 228 transitions, 1903 flow [2025-03-09 01:20:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 572 transitions. [2025-03-09 01:20:46,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.697560975609756 [2025-03-09 01:20:46,341 INFO L175 Difference]: Start difference. First operand has 137 places, 128 transitions, 1113 flow. Second operand 10 states and 572 transitions. [2025-03-09 01:20:46,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 228 transitions, 1903 flow [2025-03-09 01:20:46,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 228 transitions, 1885 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 01:20:46,496 INFO L231 Difference]: Finished difference. Result has 152 places, 133 transitions, 1160 flow [2025-03-09 01:20:46,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1160, PETRI_PLACES=152, PETRI_TRANSITIONS=133} [2025-03-09 01:20:46,497 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 74 predicate places. [2025-03-09 01:20:46,497 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 133 transitions, 1160 flow [2025-03-09 01:20:46,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:46,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:46,497 INFO L206 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1] [2025-03-09 01:20:46,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 01:20:46,498 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:46,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:46,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1525368164, now seen corresponding path program 2 times [2025-03-09 01:20:46,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:46,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731764341] [2025-03-09 01:20:46,498 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:20:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:46,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:20:46,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:20:46,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:20:46,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:46,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:46,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731764341] [2025-03-09 01:20:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731764341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067458906] [2025-03-09 01:20:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:46,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:46,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:46,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:47,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:47,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 133 transitions, 1160 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:47,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:47,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:47,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:49,185 INFO L124 PetriNetUnfolderBase]: 7479/15892 cut-off events. [2025-03-09 01:20:49,185 INFO L125 PetriNetUnfolderBase]: For 10406/10953 co-relation queries the response was YES. [2025-03-09 01:20:49,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42745 conditions, 15892 events. 7479/15892 cut-off events. For 10406/10953 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 154552 event pairs, 981 based on Foata normal form. 556/16261 useless extension candidates. Maximal degree in co-relation 42319. Up to 7841 conditions per place. [2025-03-09 01:20:49,306 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 175 selfloop transitions, 8 changer transitions 6/202 dead transitions. [2025-03-09 01:20:49,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 202 transitions, 1829 flow [2025-03-09 01:20:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 550 transitions. [2025-03-09 01:20:49,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6707317073170732 [2025-03-09 01:20:49,311 INFO L175 Difference]: Start difference. First operand has 152 places, 133 transitions, 1160 flow. Second operand 10 states and 550 transitions. [2025-03-09 01:20:49,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 202 transitions, 1829 flow [2025-03-09 01:20:49,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 202 transitions, 1810 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-09 01:20:49,632 INFO L231 Difference]: Finished difference. Result has 161 places, 135 transitions, 1192 flow [2025-03-09 01:20:49,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1192, PETRI_PLACES=161, PETRI_TRANSITIONS=135} [2025-03-09 01:20:49,632 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 83 predicate places. [2025-03-09 01:20:49,633 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 135 transitions, 1192 flow [2025-03-09 01:20:49,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:49,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:49,633 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, 1, 1, 1, 1, 1] [2025-03-09 01:20:49,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 01:20:49,633 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:49,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1642489234, now seen corresponding path program 3 times [2025-03-09 01:20:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995014593] [2025-03-09 01:20:49,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:20:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:49,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-03-09 01:20:49,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:20:49,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:20:49,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:49,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:49,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995014593] [2025-03-09 01:20:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995014593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:49,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112077214] [2025-03-09 01:20:49,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:49,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:49,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:50,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:50,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 135 transitions, 1192 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:50,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:50,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:50,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:52,260 INFO L124 PetriNetUnfolderBase]: 8122/17974 cut-off events. [2025-03-09 01:20:52,261 INFO L125 PetriNetUnfolderBase]: For 20218/20878 co-relation queries the response was YES. [2025-03-09 01:20:52,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50802 conditions, 17974 events. 8122/17974 cut-off events. For 20218/20878 co-relation queries the response was YES. Maximal size of possible extension queue 977. Compared 183682 event pairs, 1419 based on Foata normal form. 669/18363 useless extension candidates. Maximal degree in co-relation 50049. Up to 8820 conditions per place. [2025-03-09 01:20:52,384 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 174 selfloop transitions, 11 changer transitions 7/205 dead transitions. [2025-03-09 01:20:52,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 205 transitions, 1879 flow [2025-03-09 01:20:52,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 557 transitions. [2025-03-09 01:20:52,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6792682926829269 [2025-03-09 01:20:52,386 INFO L175 Difference]: Start difference. First operand has 161 places, 135 transitions, 1192 flow. Second operand 10 states and 557 transitions. [2025-03-09 01:20:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 205 transitions, 1879 flow [2025-03-09 01:20:52,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 205 transitions, 1823 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:52,728 INFO L231 Difference]: Finished difference. Result has 168 places, 137 transitions, 1223 flow [2025-03-09 01:20:52,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1223, PETRI_PLACES=168, PETRI_TRANSITIONS=137} [2025-03-09 01:20:52,728 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 90 predicate places. [2025-03-09 01:20:52,728 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 137 transitions, 1223 flow [2025-03-09 01:20:52,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:52,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:52,729 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, 1, 1, 1, 1, 1] [2025-03-09 01:20:52,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-09 01:20:52,729 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:52,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1441778816, now seen corresponding path program 4 times [2025-03-09 01:20:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570304884] [2025-03-09 01:20:52,729 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:20:52,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:52,736 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:20:52,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:20:52,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:20:52,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570304884] [2025-03-09 01:20:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570304884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263048854] [2025-03-09 01:20:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:52,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:52,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:52,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:52,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:53,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:53,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 137 transitions, 1223 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:53,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:53,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:53,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:55,164 INFO L124 PetriNetUnfolderBase]: 8433/18997 cut-off events. [2025-03-09 01:20:55,164 INFO L125 PetriNetUnfolderBase]: For 26221/26867 co-relation queries the response was YES. [2025-03-09 01:20:55,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55381 conditions, 18997 events. 8433/18997 cut-off events. For 26221/26867 co-relation queries the response was YES. Maximal size of possible extension queue 1028. Compared 197712 event pairs, 1560 based on Foata normal form. 655/19391 useless extension candidates. Maximal degree in co-relation 54517. Up to 10985 conditions per place. [2025-03-09 01:20:55,280 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 180 selfloop transitions, 11 changer transitions 6/210 dead transitions. [2025-03-09 01:20:55,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 210 transitions, 1995 flow [2025-03-09 01:20:55,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 556 transitions. [2025-03-09 01:20:55,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6780487804878049 [2025-03-09 01:20:55,281 INFO L175 Difference]: Start difference. First operand has 168 places, 137 transitions, 1223 flow. Second operand 10 states and 556 transitions. [2025-03-09 01:20:55,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 210 transitions, 1995 flow [2025-03-09 01:20:55,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 210 transitions, 1930 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-09 01:20:55,632 INFO L231 Difference]: Finished difference. Result has 175 places, 140 transitions, 1258 flow [2025-03-09 01:20:55,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1258, PETRI_PLACES=175, PETRI_TRANSITIONS=140} [2025-03-09 01:20:55,632 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 97 predicate places. [2025-03-09 01:20:55,636 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 140 transitions, 1258 flow [2025-03-09 01:20:55,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:55,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:55,637 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, 1, 1, 1, 1, 1] [2025-03-09 01:20:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 01:20:55,637 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:55,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash -56907382, now seen corresponding path program 5 times [2025-03-09 01:20:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:55,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724632820] [2025-03-09 01:20:55,638 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:20:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:55,644 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-03-09 01:20:55,656 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:20:55,656 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:20:55,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:56,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:56,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724632820] [2025-03-09 01:20:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724632820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225040169] [2025-03-09 01:20:56,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:56,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:56,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:56,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:56,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:56,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:56,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 140 transitions, 1258 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:56,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:56,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:56,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:20:59,079 INFO L124 PetriNetUnfolderBase]: 8884/20212 cut-off events. [2025-03-09 01:20:59,079 INFO L125 PetriNetUnfolderBase]: For 37913/38600 co-relation queries the response was YES. [2025-03-09 01:20:59,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61407 conditions, 20212 events. 8884/20212 cut-off events. For 37913/38600 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 212933 event pairs, 2166 based on Foata normal form. 696/20586 useless extension candidates. Maximal degree in co-relation 60432. Up to 12330 conditions per place. [2025-03-09 01:20:59,196 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 180 selfloop transitions, 14 changer transitions 7/214 dead transitions. [2025-03-09 01:20:59,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 214 transitions, 2037 flow [2025-03-09 01:20:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:20:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:20:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 559 transitions. [2025-03-09 01:20:59,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6817073170731708 [2025-03-09 01:20:59,198 INFO L175 Difference]: Start difference. First operand has 175 places, 140 transitions, 1258 flow. Second operand 10 states and 559 transitions. [2025-03-09 01:20:59,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 214 transitions, 2037 flow [2025-03-09 01:20:59,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 214 transitions, 1962 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-03-09 01:20:59,525 INFO L231 Difference]: Finished difference. Result has 181 places, 143 transitions, 1298 flow [2025-03-09 01:20:59,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1298, PETRI_PLACES=181, PETRI_TRANSITIONS=143} [2025-03-09 01:20:59,526 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 103 predicate places. [2025-03-09 01:20:59,526 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 143 transitions, 1298 flow [2025-03-09 01:20:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:59,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:20:59,526 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, 1, 1, 1, 1, 1] [2025-03-09 01:20:59,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-09 01:20:59,526 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:20:59,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:20:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -209828378, now seen corresponding path program 6 times [2025-03-09 01:20:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:20:59,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113654612] [2025-03-09 01:20:59,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:20:59,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:20:59,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-03-09 01:20:59,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:20:59,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:20:59,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:20:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:20:59,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:20:59,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113654612] [2025-03-09 01:20:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113654612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:20:59,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:20:59,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:20:59,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284287411] [2025-03-09 01:20:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:20:59,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:20:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:20:59,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:20:59,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:20:59,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:20:59,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 143 transitions, 1298 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:20:59,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:20:59,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:20:59,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:02,374 INFO L124 PetriNetUnfolderBase]: 10583/24053 cut-off events. [2025-03-09 01:21:02,374 INFO L125 PetriNetUnfolderBase]: For 55381/56204 co-relation queries the response was YES. [2025-03-09 01:21:02,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74900 conditions, 24053 events. 10583/24053 cut-off events. For 55381/56204 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 262395 event pairs, 1955 based on Foata normal form. 832/24543 useless extension candidates. Maximal degree in co-relation 73742. Up to 13124 conditions per place. [2025-03-09 01:21:02,791 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 191 selfloop transitions, 14 changer transitions 6/224 dead transitions. [2025-03-09 01:21:02,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 224 transitions, 2171 flow [2025-03-09 01:21:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 561 transitions. [2025-03-09 01:21:02,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6841463414634147 [2025-03-09 01:21:02,792 INFO L175 Difference]: Start difference. First operand has 181 places, 143 transitions, 1298 flow. Second operand 10 states and 561 transitions. [2025-03-09 01:21:02,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 224 transitions, 2171 flow [2025-03-09 01:21:03,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 224 transitions, 2085 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:03,359 INFO L231 Difference]: Finished difference. Result has 189 places, 147 transitions, 1355 flow [2025-03-09 01:21:03,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1355, PETRI_PLACES=189, PETRI_TRANSITIONS=147} [2025-03-09 01:21:03,359 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 111 predicate places. [2025-03-09 01:21:03,359 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 147 transitions, 1355 flow [2025-03-09 01:21:03,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:03,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:03,360 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:03,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-09 01:21:03,360 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:03,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2106528016, now seen corresponding path program 7 times [2025-03-09 01:21:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:03,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233176952] [2025-03-09 01:21:03,360 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:21:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:03,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:21:03,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:21:03,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:03,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:03,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233176952] [2025-03-09 01:21:03,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233176952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:03,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:03,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024809432] [2025-03-09 01:21:03,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:03,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:03,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:03,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:03,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:03,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:03,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 147 transitions, 1355 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:03,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:03,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:03,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:07,196 INFO L124 PetriNetUnfolderBase]: 10621/24065 cut-off events. [2025-03-09 01:21:07,196 INFO L125 PetriNetUnfolderBase]: For 70874/71744 co-relation queries the response was YES. [2025-03-09 01:21:07,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76709 conditions, 24065 events. 10621/24065 cut-off events. For 70874/71744 co-relation queries the response was YES. Maximal size of possible extension queue 1342. Compared 260579 event pairs, 2338 based on Foata normal form. 879/24533 useless extension candidates. Maximal degree in co-relation 75510. Up to 13431 conditions per place. [2025-03-09 01:21:07,603 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 195 selfloop transitions, 15 changer transitions 7/230 dead transitions. [2025-03-09 01:21:07,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 230 transitions, 2248 flow [2025-03-09 01:21:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 563 transitions. [2025-03-09 01:21:07,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6865853658536586 [2025-03-09 01:21:07,605 INFO L175 Difference]: Start difference. First operand has 189 places, 147 transitions, 1355 flow. Second operand 10 states and 563 transitions. [2025-03-09 01:21:07,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 230 transitions, 2248 flow [2025-03-09 01:21:08,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 230 transitions, 2199 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:08,675 INFO L231 Difference]: Finished difference. Result has 199 places, 151 transitions, 1430 flow [2025-03-09 01:21:08,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1430, PETRI_PLACES=199, PETRI_TRANSITIONS=151} [2025-03-09 01:21:08,675 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 121 predicate places. [2025-03-09 01:21:08,676 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 151 transitions, 1430 flow [2025-03-09 01:21:08,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:08,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:08,676 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:08,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-09 01:21:08,676 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:08,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:08,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2046174354, now seen corresponding path program 8 times [2025-03-09 01:21:08,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:08,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246165377] [2025-03-09 01:21:08,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:08,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:21:08,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:21:08,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:08,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:08,984 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:08,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:08,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246165377] [2025-03-09 01:21:08,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246165377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:08,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:08,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:08,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035459428] [2025-03-09 01:21:08,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:08,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:08,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:08,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:08,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:09,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:09,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 151 transitions, 1430 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:09,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:09,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:09,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:11,743 INFO L124 PetriNetUnfolderBase]: 10648/24186 cut-off events. [2025-03-09 01:21:11,743 INFO L125 PetriNetUnfolderBase]: For 88487/89380 co-relation queries the response was YES. [2025-03-09 01:21:12,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80146 conditions, 24186 events. 10648/24186 cut-off events. For 88487/89380 co-relation queries the response was YES. Maximal size of possible extension queue 1332. Compared 261632 event pairs, 3407 based on Foata normal form. 902/24487 useless extension candidates. Maximal degree in co-relation 78906. Up to 11197 conditions per place. [2025-03-09 01:21:12,120 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 205 selfloop transitions, 13 changer transitions 6/237 dead transitions. [2025-03-09 01:21:12,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 237 transitions, 2366 flow [2025-03-09 01:21:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 568 transitions. [2025-03-09 01:21:12,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6926829268292682 [2025-03-09 01:21:12,122 INFO L175 Difference]: Start difference. First operand has 199 places, 151 transitions, 1430 flow. Second operand 10 states and 568 transitions. [2025-03-09 01:21:12,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 237 transitions, 2366 flow [2025-03-09 01:21:13,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 237 transitions, 2317 flow, removed 15 selfloop flow, removed 4 redundant places. [2025-03-09 01:21:13,100 INFO L231 Difference]: Finished difference. Result has 210 places, 156 transitions, 1518 flow [2025-03-09 01:21:13,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1518, PETRI_PLACES=210, PETRI_TRANSITIONS=156} [2025-03-09 01:21:13,100 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 132 predicate places. [2025-03-09 01:21:13,100 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 156 transitions, 1518 flow [2025-03-09 01:21:13,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:13,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:13,100 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:13,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-09 01:21:13,101 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:13,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:13,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1074049306, now seen corresponding path program 9 times [2025-03-09 01:21:13,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:13,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132778917] [2025-03-09 01:21:13,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:21:13,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:13,107 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-03-09 01:21:13,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:21:13,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:21:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:13,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132778917] [2025-03-09 01:21:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132778917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335466252] [2025-03-09 01:21:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:13,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:13,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:13,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:13,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:13,425 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:13,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 156 transitions, 1518 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:13,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:13,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:15,917 INFO L124 PetriNetUnfolderBase]: 10693/24522 cut-off events. [2025-03-09 01:21:15,917 INFO L125 PetriNetUnfolderBase]: For 101379/102195 co-relation queries the response was YES. [2025-03-09 01:21:16,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83206 conditions, 24522 events. 10693/24522 cut-off events. For 101379/102195 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 269343 event pairs, 1581 based on Foata normal form. 825/25036 useless extension candidates. Maximal degree in co-relation 81960. Up to 13575 conditions per place. [2025-03-09 01:21:16,254 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 201 selfloop transitions, 20 changer transitions 6/240 dead transitions. [2025-03-09 01:21:16,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 240 transitions, 2456 flow [2025-03-09 01:21:16,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:16,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 559 transitions. [2025-03-09 01:21:16,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6817073170731708 [2025-03-09 01:21:16,255 INFO L175 Difference]: Start difference. First operand has 210 places, 156 transitions, 1518 flow. Second operand 10 states and 559 transitions. [2025-03-09 01:21:16,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 240 transitions, 2456 flow [2025-03-09 01:21:17,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 240 transitions, 2395 flow, removed 28 selfloop flow, removed 3 redundant places. [2025-03-09 01:21:17,233 INFO L231 Difference]: Finished difference. Result has 220 places, 159 transitions, 1590 flow [2025-03-09 01:21:17,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1590, PETRI_PLACES=220, PETRI_TRANSITIONS=159} [2025-03-09 01:21:17,233 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 142 predicate places. [2025-03-09 01:21:17,233 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 159 transitions, 1590 flow [2025-03-09 01:21:17,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:17,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:17,233 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:17,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-09 01:21:17,234 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:17,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:17,234 INFO L85 PathProgramCache]: Analyzing trace with hash -357696466, now seen corresponding path program 10 times [2025-03-09 01:21:17,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450177017] [2025-03-09 01:21:17,234 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 01:21:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:17,241 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:21:17,244 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:21:17,244 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 01:21:17,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:17,449 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:17,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450177017] [2025-03-09 01:21:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450177017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:17,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:17,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367640668] [2025-03-09 01:21:17,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:17,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:17,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:17,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:17,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:17,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:17,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 159 transitions, 1590 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:17,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:17,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:17,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:20,430 INFO L124 PetriNetUnfolderBase]: 10936/25127 cut-off events. [2025-03-09 01:21:20,430 INFO L125 PetriNetUnfolderBase]: For 110250/111093 co-relation queries the response was YES. [2025-03-09 01:21:20,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86726 conditions, 25127 events. 10936/25127 cut-off events. For 110250/111093 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 277709 event pairs, 1867 based on Foata normal form. 852/25580 useless extension candidates. Maximal degree in co-relation 85404. Up to 13575 conditions per place. [2025-03-09 01:21:20,801 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 198 selfloop transitions, 18 changer transitions 7/236 dead transitions. [2025-03-09 01:21:20,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 236 transitions, 2516 flow [2025-03-09 01:21:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 560 transitions. [2025-03-09 01:21:20,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2025-03-09 01:21:20,802 INFO L175 Difference]: Start difference. First operand has 220 places, 159 transitions, 1590 flow. Second operand 10 states and 560 transitions. [2025-03-09 01:21:20,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 236 transitions, 2516 flow [2025-03-09 01:21:21,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 236 transitions, 2407 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-03-09 01:21:21,916 INFO L231 Difference]: Finished difference. Result has 226 places, 161 transitions, 1611 flow [2025-03-09 01:21:21,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1539, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1611, PETRI_PLACES=226, PETRI_TRANSITIONS=161} [2025-03-09 01:21:21,916 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 148 predicate places. [2025-03-09 01:21:21,916 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 161 transitions, 1611 flow [2025-03-09 01:21:21,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:21,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:21,917 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:21,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-09 01:21:21,917 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:21,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:21,917 INFO L85 PathProgramCache]: Analyzing trace with hash 237581566, now seen corresponding path program 11 times [2025-03-09 01:21:21,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:21,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363370518] [2025-03-09 01:21:21,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 01:21:21,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:21,924 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-03-09 01:21:21,940 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:21:21,940 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 01:21:21,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:22,271 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:22,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:22,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363370518] [2025-03-09 01:21:22,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363370518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:22,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:22,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:22,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461186529] [2025-03-09 01:21:22,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:22,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:22,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:22,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:22,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:22,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:22,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 161 transitions, 1611 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:22,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:22,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:22,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:25,591 INFO L124 PetriNetUnfolderBase]: 10927/25134 cut-off events. [2025-03-09 01:21:25,591 INFO L125 PetriNetUnfolderBase]: For 91137/91953 co-relation queries the response was YES. [2025-03-09 01:21:25,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85024 conditions, 25134 events. 10927/25134 cut-off events. For 91137/91953 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 277818 event pairs, 1662 based on Foata normal form. 825/25648 useless extension candidates. Maximal degree in co-relation 83700. Up to 13575 conditions per place. [2025-03-09 01:21:25,889 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 199 selfloop transitions, 21 changer transitions 7/240 dead transitions. [2025-03-09 01:21:25,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 240 transitions, 2499 flow [2025-03-09 01:21:25,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:25,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 559 transitions. [2025-03-09 01:21:25,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6817073170731708 [2025-03-09 01:21:25,890 INFO L175 Difference]: Start difference. First operand has 226 places, 161 transitions, 1611 flow. Second operand 10 states and 559 transitions. [2025-03-09 01:21:25,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 240 transitions, 2499 flow [2025-03-09 01:21:26,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 240 transitions, 2442 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-03-09 01:21:26,797 INFO L231 Difference]: Finished difference. Result has 231 places, 163 transitions, 1653 flow [2025-03-09 01:21:26,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1653, PETRI_PLACES=231, PETRI_TRANSITIONS=163} [2025-03-09 01:21:26,798 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 153 predicate places. [2025-03-09 01:21:26,798 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 163 transitions, 1653 flow [2025-03-09 01:21:26,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:26,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:26,799 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:26,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-09 01:21:26,799 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:26,799 INFO L85 PathProgramCache]: Analyzing trace with hash 534123280, now seen corresponding path program 12 times [2025-03-09 01:21:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120347339] [2025-03-09 01:21:26,799 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 01:21:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:26,806 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 4 equivalence classes. [2025-03-09 01:21:26,809 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:21:26,809 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 01:21:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120347339] [2025-03-09 01:21:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120347339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:26,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:26,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714835166] [2025-03-09 01:21:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:26,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:26,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:26,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:27,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:27,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 163 transitions, 1653 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:27,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:27,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:27,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:30,374 INFO L124 PetriNetUnfolderBase]: 10864/24864 cut-off events. [2025-03-09 01:21:30,375 INFO L125 PetriNetUnfolderBase]: For 97284/98127 co-relation queries the response was YES. [2025-03-09 01:21:30,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85192 conditions, 24864 events. 10864/24864 cut-off events. For 97284/98127 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 272585 event pairs, 2544 based on Foata normal form. 852/25315 useless extension candidates. Maximal degree in co-relation 83865. Up to 13575 conditions per place. [2025-03-09 01:21:30,586 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 193 selfloop transitions, 23 changer transitions 6/235 dead transitions. [2025-03-09 01:21:30,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 235 transitions, 2500 flow [2025-03-09 01:21:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 553 transitions. [2025-03-09 01:21:30,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6743902439024391 [2025-03-09 01:21:30,587 INFO L175 Difference]: Start difference. First operand has 231 places, 163 transitions, 1653 flow. Second operand 10 states and 553 transitions. [2025-03-09 01:21:30,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 235 transitions, 2500 flow [2025-03-09 01:21:31,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 235 transitions, 2459 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-09 01:21:31,441 INFO L231 Difference]: Finished difference. Result has 236 places, 165 transitions, 1708 flow [2025-03-09 01:21:31,441 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1616, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1708, PETRI_PLACES=236, PETRI_TRANSITIONS=165} [2025-03-09 01:21:31,442 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 158 predicate places. [2025-03-09 01:21:31,442 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 165 transitions, 1708 flow [2025-03-09 01:21:31,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:31,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:31,442 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:31,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-09 01:21:31,443 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:31,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:31,443 INFO L85 PathProgramCache]: Analyzing trace with hash -442792828, now seen corresponding path program 13 times [2025-03-09 01:21:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:31,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031982212] [2025-03-09 01:21:31,443 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 01:21:31,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:31,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 01:21:31,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 01:21:31,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:21:31,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:31,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031982212] [2025-03-09 01:21:31,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031982212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:31,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:31,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:31,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971158978] [2025-03-09 01:21:31,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:31,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:31,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:31,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:31,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:31,887 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:31,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 165 transitions, 1708 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:31,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:31,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:31,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:35,281 INFO L124 PetriNetUnfolderBase]: 10891/25089 cut-off events. [2025-03-09 01:21:35,282 INFO L125 PetriNetUnfolderBase]: For 101103/101892 co-relation queries the response was YES. [2025-03-09 01:21:35,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86394 conditions, 25089 events. 10891/25089 cut-off events. For 101103/101892 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 277510 event pairs, 1779 based on Foata normal form. 798/25558 useless extension candidates. Maximal degree in co-relation 85065. Up to 13575 conditions per place. [2025-03-09 01:21:35,457 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 189 selfloop transitions, 25 changer transitions 6/233 dead transitions. [2025-03-09 01:21:35,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 233 transitions, 2529 flow [2025-03-09 01:21:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:35,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 552 transitions. [2025-03-09 01:21:35,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6731707317073171 [2025-03-09 01:21:35,458 INFO L175 Difference]: Start difference. First operand has 236 places, 165 transitions, 1708 flow. Second operand 10 states and 552 transitions. [2025-03-09 01:21:35,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 233 transitions, 2529 flow [2025-03-09 01:21:36,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 233 transitions, 2471 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-03-09 01:21:36,194 INFO L231 Difference]: Finished difference. Result has 238 places, 167 transitions, 1761 flow [2025-03-09 01:21:36,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1761, PETRI_PLACES=238, PETRI_TRANSITIONS=167} [2025-03-09 01:21:36,194 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 160 predicate places. [2025-03-09 01:21:36,195 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 167 transitions, 1761 flow [2025-03-09 01:21:36,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:36,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:36,195 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:36,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-09 01:21:36,195 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:36,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1107727948, now seen corresponding path program 14 times [2025-03-09 01:21:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:36,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909169978] [2025-03-09 01:21:36,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:21:36,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:36,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 01:21:36,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:21:36,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:21:36,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:36,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:36,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909169978] [2025-03-09 01:21:36,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909169978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:36,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:36,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:36,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506768917] [2025-03-09 01:21:36,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:36,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:36,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:36,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:36,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:36,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:36,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 167 transitions, 1761 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:36,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:36,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:36,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:39,627 INFO L124 PetriNetUnfolderBase]: 10828/24819 cut-off events. [2025-03-09 01:21:39,627 INFO L125 PetriNetUnfolderBase]: For 105495/106338 co-relation queries the response was YES. [2025-03-09 01:21:39,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86107 conditions, 24819 events. 10828/24819 cut-off events. For 105495/106338 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 272422 event pairs, 2535 based on Foata normal form. 852/25288 useless extension candidates. Maximal degree in co-relation 84777. Up to 13575 conditions per place. [2025-03-09 01:21:39,824 INFO L140 encePairwiseOnDemand]: 73/82 looper letters, 188 selfloop transitions, 23 changer transitions 9/233 dead transitions. [2025-03-09 01:21:39,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 233 transitions, 2524 flow [2025-03-09 01:21:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:21:39,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 01:21:39,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 552 transitions. [2025-03-09 01:21:39,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6731707317073171 [2025-03-09 01:21:39,826 INFO L175 Difference]: Start difference. First operand has 238 places, 167 transitions, 1761 flow. Second operand 10 states and 552 transitions. [2025-03-09 01:21:39,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 233 transitions, 2524 flow [2025-03-09 01:21:40,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 233 transitions, 2460 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-03-09 01:21:40,634 INFO L231 Difference]: Finished difference. Result has 240 places, 165 transitions, 1718 flow [2025-03-09 01:21:40,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1718, PETRI_PLACES=240, PETRI_TRANSITIONS=165} [2025-03-09 01:21:40,635 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 162 predicate places. [2025-03-09 01:21:40,635 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 165 transitions, 1718 flow [2025-03-09 01:21:40,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:40,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 01:21:40,635 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, 1, 1, 1, 1, 1] [2025-03-09 01:21:40,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-09 01:21:40,636 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-03-09 01:21:40,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:21:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash -2055204732, now seen corresponding path program 15 times [2025-03-09 01:21:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:21:40,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779941751] [2025-03-09 01:21:40,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:21:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:21:40,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-03-09 01:21:40,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 25 of 37 statements. [2025-03-09 01:21:40,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 01:21:40,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:21:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 01:21:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:21:40,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779941751] [2025-03-09 01:21:40,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779941751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:21:40,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:21:40,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 01:21:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84588681] [2025-03-09 01:21:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:21:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 01:21:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:21:40,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 01:21:40,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 01:21:40,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 82 [2025-03-09 01:21:40,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 165 transitions, 1718 flow. Second operand has 10 states, 10 states have (on average 49.2) internal successors, (492), 10 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:21:40,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 01:21:40,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 82 [2025-03-09 01:21:40,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 01:21:44,661 INFO L124 PetriNetUnfolderBase]: 10846/24954 cut-off events. [2025-03-09 01:21:44,661 INFO L125 PetriNetUnfolderBase]: For 102144/102915 co-relation queries the response was YES.