./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 08:35:08,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:35:09,096 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:35:09,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:35:09,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:35:09,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:35:09,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:35:09,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:35:09,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:35:09,114 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:35:09,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:35:09,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:35:09,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:35:09,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:35:09,115 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:35:09,115 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:35:09,115 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:35:09,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:35:09,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:35:09,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:35:09,115 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:35:09,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:35:09,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:35:09,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:35:09,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:35:09,117 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-jdk21/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-02-08 08:35:09,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:35:09,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:35:09,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:35:09,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:35:09,293 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:35:09,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 08:35:10,428 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b8ebdf66/9e91914adaee45b9a9d32238657f4e52/FLAG694216eb2 [2025-02-08 08:35:10,710 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:35:10,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-08 08:35:10,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b8ebdf66/9e91914adaee45b9a9d32238657f4e52/FLAG694216eb2 [2025-02-08 08:35:11,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b8ebdf66/9e91914adaee45b9a9d32238657f4e52 [2025-02-08 08:35:11,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:35:11,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:35:11,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:35:11,043 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:35:11,046 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:35:11,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473046f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11, skipping insertion in model container [2025-02-08 08:35:11,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:35:11,215 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:35:11,221 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 08:35:11,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:35:11,231 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:35:11,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:35:11,276 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:35:11,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11 WrapperNode [2025-02-08 08:35:11,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:35:11,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:35:11,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:35:11,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:35:11,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,305 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 279 [2025-02-08 08:35:11,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:35:11,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:35:11,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:35:11,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:35:11,311 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,315 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,331 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 10, 6]. 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-02-08 08:35:11,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:35:11,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:35:11,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:35:11,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:35:11,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (1/1) ... [2025-02-08 08:35:11,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:35:11,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:11,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 08:35:11,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 08:35:11,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:35:11,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 08:35:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 08:35:11,388 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 08:35:11,388 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 08:35:11,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:35:11,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:35:11,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 08:35:11,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:35:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:35:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 08:35:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:35:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:35:11,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:35:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:35:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:35:11,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 08:35:11,390 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 08:35:11,474 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:35:11,476 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:35:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-8: #t~ite9#1 := #t~ret8#1; [2025-02-08 08:35:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret8#1 && #t~ret8#1 <= 2147483647; [2025-02-08 08:35:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:35:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:35:11,692 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L52-12: #t~ret8#1 := minus_#res#1; [2025-02-08 08:35:11,838 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-8: #t~ite18#1 := #t~ret17#1; [2025-02-08 08:35:11,838 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-9: assume { :end_inline_minus } true;assume -2147483648 <= #t~ret17#1 && #t~ret17#1 <= 2147483647; [2025-02-08 08:35:11,838 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-10: havoc minus_#in~a#1, minus_#in~b#1; [2025-02-08 08:35:11,839 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-11: havoc minus_~a#1, minus_~b#1; [2025-02-08 08:35:11,839 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L60-12: #t~ret17#1 := minus_#res#1; [2025-02-08 08:35:12,190 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 08:35:12,190 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:35:12,460 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:35:12,460 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 08:35:12,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:35:12 BoogieIcfgContainer [2025-02-08 08:35:12,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:35:12,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:35:12,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:35:12,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:35:12,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:35:11" (1/3) ... [2025-02-08 08:35:12,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ee105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:35:12, skipping insertion in model container [2025-02-08 08:35:12,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:35:11" (2/3) ... [2025-02-08 08:35:12,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ee105c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:35:12, skipping insertion in model container [2025-02-08 08:35:12,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:35:12" (3/3) ... [2025-02-08 08:35:12,494 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-02-08 08:35:12,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:35:12,509 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-02-08 08:35:12,509 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 08:35:12,561 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 08:35:12,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 80 transitions, 174 flow [2025-02-08 08:35:12,607 INFO L124 PetriNetUnfolderBase]: 6/78 cut-off events. [2025-02-08 08:35:12,609 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 08:35:12,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 6/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 233 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2025-02-08 08:35:12,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 80 transitions, 174 flow [2025-02-08 08:35:12,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 77 transitions, 166 flow [2025-02-08 08:35:12,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:35:12,634 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;@d30e64d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:35:12,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-02-08 08:35:12,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 08:35:12,637 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2025-02-08 08:35:12,637 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 08:35:12,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:12,638 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:35:12,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:12,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:12,642 INFO L85 PathProgramCache]: Analyzing trace with hash 826020, now seen corresponding path program 1 times [2025-02-08 08:35:12,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:12,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112982419] [2025-02-08 08:35:12,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:12,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:12,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:35:12,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:35:12,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:12,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:35:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:12,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112982419] [2025-02-08 08:35:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112982419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:12,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:12,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 08:35:12,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729164701] [2025-02-08 08:35:12,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:12,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:35:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:12,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:35:12,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:35:12,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:12,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 166 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-02-08 08:35:12,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:12,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:12,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:12,985 INFO L124 PetriNetUnfolderBase]: 152/534 cut-off events. [2025-02-08 08:35:12,985 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 08:35:12,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 534 events. 152/534 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3449 event pairs, 110 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 735. Up to 257 conditions per place. [2025-02-08 08:35:12,994 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 30 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-02-08 08:35:12,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 73 transitions, 222 flow [2025-02-08 08:35:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:35:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:35:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-02-08 08:35:13,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6958333333333333 [2025-02-08 08:35:13,004 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 166 flow. Second operand 3 states and 167 transitions. [2025-02-08 08:35:13,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 73 transitions, 222 flow [2025-02-08 08:35:13,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 73 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:35:13,009 INFO L231 Difference]: Finished difference. Result has 72 places, 73 transitions, 154 flow [2025-02-08 08:35:13,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=72, PETRI_TRANSITIONS=73} [2025-02-08 08:35:13,013 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -6 predicate places. [2025-02-08 08:35:13,013 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 73 transitions, 154 flow [2025-02-08 08:35:13,013 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-02-08 08:35:13,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:13,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 08:35:13,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:35:13,014 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:13,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash 826021, now seen corresponding path program 1 times [2025-02-08 08:35:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286323754] [2025-02-08 08:35:13,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:13,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 08:35:13,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 08:35:13,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:13,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:35:13,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:13,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286323754] [2025-02-08 08:35:13,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286323754] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:13,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:13,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:35:13,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610036139] [2025-02-08 08:35:13,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:13,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:35:13,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:13,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:35:13,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:35:13,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:13,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 154 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-02-08 08:35:13,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:13,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:13,478 INFO L124 PetriNetUnfolderBase]: 153/537 cut-off events. [2025-02-08 08:35:13,479 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:35:13,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 537 events. 153/537 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3464 event pairs, 110 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 787. Up to 266 conditions per place. [2025-02-08 08:35:13,482 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 34 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2025-02-08 08:35:13,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 234 flow [2025-02-08 08:35:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:35:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:35:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2025-02-08 08:35:13,484 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-02-08 08:35:13,484 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 154 flow. Second operand 3 states and 170 transitions. [2025-02-08 08:35:13,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 234 flow [2025-02-08 08:35:13,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 76 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:13,486 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 169 flow [2025-02-08 08:35:13,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-02-08 08:35:13,489 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -5 predicate places. [2025-02-08 08:35:13,489 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 169 flow [2025-02-08 08:35:13,489 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-02-08 08:35:13,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:13,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-02-08 08:35:13,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:35:13,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:13,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 25609390, now seen corresponding path program 1 times [2025-02-08 08:35:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894867734] [2025-02-08 08:35:13,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:13,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:13,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:35:13,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:35:13,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:13,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:35:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:13,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894867734] [2025-02-08 08:35:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894867734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:13,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:35:13,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327054027] [2025-02-08 08:35:13,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:13,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:35:13,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:13,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:35:13,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:35:13,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:13,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 169 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-02-08 08:35:13,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:13,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:13,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:13,699 INFO L124 PetriNetUnfolderBase]: 152/536 cut-off events. [2025-02-08 08:35:13,699 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 08:35:13,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 536 events. 152/536 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3444 event pairs, 110 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 804. Up to 263 conditions per place. [2025-02-08 08:35:13,702 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 32 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-02-08 08:35:13,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 75 transitions, 234 flow [2025-02-08 08:35:13,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:35:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:35:13,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2025-02-08 08:35:13,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7208333333333333 [2025-02-08 08:35:13,704 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 169 flow. Second operand 3 states and 173 transitions. [2025-02-08 08:35:13,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 75 transitions, 234 flow [2025-02-08 08:35:13,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 75 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 08:35:13,706 INFO L231 Difference]: Finished difference. Result has 74 places, 74 transitions, 166 flow [2025-02-08 08:35:13,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=74, PETRI_TRANSITIONS=74} [2025-02-08 08:35:13,706 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -4 predicate places. [2025-02-08 08:35:13,706 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 74 transitions, 166 flow [2025-02-08 08:35:13,707 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-02-08 08:35:13,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:13,707 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2025-02-08 08:35:13,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:35:13,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:13,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 793831689, now seen corresponding path program 1 times [2025-02-08 08:35:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83106619] [2025-02-08 08:35:13,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:13,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:35:13,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:35:13,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:13,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:35:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83106619] [2025-02-08 08:35:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83106619] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:14,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687142447] [2025-02-08 08:35:14,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:14,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:14,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:14,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:14,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 08:35:14,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 08:35:14,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 08:35:14,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:14,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:14,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:35:14,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:14,176 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-02-08 08:35:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:35:14,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 08:35:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687142447] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:14,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:14,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2025-02-08 08:35:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911192179] [2025-02-08 08:35:14,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:14,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:35:14,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:14,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:35:14,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:35:14,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:14,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 166 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-02-08 08:35:14,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:14,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:14,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:15,032 INFO L124 PetriNetUnfolderBase]: 152/535 cut-off events. [2025-02-08 08:35:15,033 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:35:15,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 535 events. 152/535 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3443 event pairs, 110 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 803. Up to 261 conditions per place. [2025-02-08 08:35:15,036 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 30 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2025-02-08 08:35:15,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 234 flow [2025-02-08 08:35:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:35:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:35:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 256 transitions. [2025-02-08 08:35:15,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-02-08 08:35:15,037 INFO L175 Difference]: Start difference. First operand has 74 places, 74 transitions, 166 flow. Second operand 5 states and 256 transitions. [2025-02-08 08:35:15,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 74 transitions, 234 flow [2025-02-08 08:35:15,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:15,039 INFO L231 Difference]: Finished difference. Result has 76 places, 74 transitions, 176 flow [2025-02-08 08:35:15,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=76, PETRI_TRANSITIONS=74} [2025-02-08 08:35:15,040 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -2 predicate places. [2025-02-08 08:35:15,040 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 74 transitions, 176 flow [2025-02-08 08:35:15,040 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-02-08 08:35:15,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:15,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 08:35:15,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 08:35:15,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:15,246 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:15,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1161018678, now seen corresponding path program 1 times [2025-02-08 08:35:15,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:15,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136339912] [2025-02-08 08:35:15,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:15,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:15,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 08:35:15,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 08:35:15,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:15,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:15,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:15,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136339912] [2025-02-08 08:35:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136339912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:15,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:15,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:15,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661792216] [2025-02-08 08:35:15,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:15,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:35:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:15,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:35:15,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:35:15,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:15,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 74 transitions, 176 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-02-08 08:35:15,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:15,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:15,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:15,551 INFO L124 PetriNetUnfolderBase]: 152/537 cut-off events. [2025-02-08 08:35:15,551 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:35:15,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 537 events. 152/537 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3446 event pairs, 110 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 799. Up to 263 conditions per place. [2025-02-08 08:35:15,553 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 33 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-02-08 08:35:15,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 254 flow [2025-02-08 08:35:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:35:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:35:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2025-02-08 08:35:15,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671875 [2025-02-08 08:35:15,555 INFO L175 Difference]: Start difference. First operand has 76 places, 74 transitions, 176 flow. Second operand 4 states and 215 transitions. [2025-02-08 08:35:15,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 254 flow [2025-02-08 08:35:15,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 244 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:15,556 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 186 flow [2025-02-08 08:35:15,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2025-02-08 08:35:15,557 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -1 predicate places. [2025-02-08 08:35:15,557 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 186 flow [2025-02-08 08:35:15,557 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-02-08 08:35:15,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:15,557 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:15,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:35:15,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:15,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:15,558 INFO L85 PathProgramCache]: Analyzing trace with hash 952574011, now seen corresponding path program 1 times [2025-02-08 08:35:15,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:15,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130156464] [2025-02-08 08:35:15,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:15,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:35:15,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:35:15,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:15,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:15,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130156464] [2025-02-08 08:35:15,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130156464] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:15,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35396159] [2025-02-08 08:35:15,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:15,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:15,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:15,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:15,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 08:35:15,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 08:35:15,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 08:35:15,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:15,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:15,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 08:35:15,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:15,811 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-02-08 08:35:15,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:15,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:16,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35396159] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:16,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:16,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2025-02-08 08:35:16,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093767840] [2025-02-08 08:35:16,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:16,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:35:16,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:16,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:35:16,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:35:16,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:16,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 186 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-02-08 08:35:16,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:16,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:16,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:16,862 INFO L124 PetriNetUnfolderBase]: 154/542 cut-off events. [2025-02-08 08:35:16,863 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 08:35:16,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 542 events. 154/542 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3451 event pairs, 110 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 809. Up to 257 conditions per place. [2025-02-08 08:35:16,866 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 26 selfloop transitions, 16 changer transitions 0/81 dead transitions. [2025-02-08 08:35:16,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 295 flow [2025-02-08 08:35:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:35:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:35:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 440 transitions. [2025-02-08 08:35:16,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-08 08:35:16,868 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 186 flow. Second operand 9 states and 440 transitions. [2025-02-08 08:35:16,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 295 flow [2025-02-08 08:35:16,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:16,871 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 238 flow [2025-02-08 08:35:16,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=238, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-02-08 08:35:16,873 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-02-08 08:35:16,873 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 238 flow [2025-02-08 08:35:16,873 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-02-08 08:35:16,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:16,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:16,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 08:35:17,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:17,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:17,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:17,079 INFO L85 PathProgramCache]: Analyzing trace with hash -534977199, now seen corresponding path program 1 times [2025-02-08 08:35:17,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:17,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469378284] [2025-02-08 08:35:17,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:17,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:35:17,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:35:17,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:17,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469378284] [2025-02-08 08:35:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469378284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:17,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:17,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:35:17,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11090380] [2025-02-08 08:35:17,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:17,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:35:17,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:17,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:35:17,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:35:17,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:17,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 238 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-02-08 08:35:17,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:17,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:17,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:17,426 INFO L124 PetriNetUnfolderBase]: 154/540 cut-off events. [2025-02-08 08:35:17,426 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:35:17,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 540 events. 154/540 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3452 event pairs, 110 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 814. Up to 266 conditions per place. [2025-02-08 08:35:17,429 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 39 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-02-08 08:35:17,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 318 flow [2025-02-08 08:35:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:35:17,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:35:17,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-02-08 08:35:17,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-02-08 08:35:17,431 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 238 flow. Second operand 3 states and 166 transitions. [2025-02-08 08:35:17,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 318 flow [2025-02-08 08:35:17,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 299 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:17,433 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 221 flow [2025-02-08 08:35:17,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-02-08 08:35:17,433 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-02-08 08:35:17,433 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 221 flow [2025-02-08 08:35:17,434 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-02-08 08:35:17,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:17,434 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:17,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:35:17,434 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:17,435 INFO L85 PathProgramCache]: Analyzing trace with hash -534977198, now seen corresponding path program 1 times [2025-02-08 08:35:17,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:17,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787498360] [2025-02-08 08:35:17,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:17,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:35:17,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:35:17,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:17,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:17,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787498360] [2025-02-08 08:35:17,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787498360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236992571] [2025-02-08 08:35:17,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:17,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:17,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:17,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:17,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 08:35:17,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 08:35:17,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 08:35:17,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:17,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:17,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:35:17,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:17,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:17,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2025-02-08 08:35:17,741 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 0 case distinctions, treesize of input 14 treesize of output 3 [2025-02-08 08:35:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:17,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:35:17,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236992571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:17,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:35:17,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2025-02-08 08:35:17,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775849195] [2025-02-08 08:35:17,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:17,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:35:17,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:17,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:35:17,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 08:35:17,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:17,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 221 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-02-08 08:35:17,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:17,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:17,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:17,928 INFO L124 PetriNetUnfolderBase]: 155/543 cut-off events. [2025-02-08 08:35:17,928 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 08:35:17,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 543 events. 155/543 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3464 event pairs, 110 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 820. Up to 274 conditions per place. [2025-02-08 08:35:17,951 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 42 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2025-02-08 08:35:17,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 82 transitions, 321 flow [2025-02-08 08:35:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:35:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:35:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-02-08 08:35:17,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-02-08 08:35:17,952 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 221 flow. Second operand 4 states and 214 transitions. [2025-02-08 08:35:17,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 82 transitions, 321 flow [2025-02-08 08:35:17,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 315 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:17,953 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 239 flow [2025-02-08 08:35:17,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2025-02-08 08:35:17,954 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-02-08 08:35:17,954 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 239 flow [2025-02-08 08:35:17,954 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-02-08 08:35:17,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:17,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:17,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:35:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:18,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash 595578872, now seen corresponding path program 1 times [2025-02-08 08:35:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343949907] [2025-02-08 08:35:18,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:18,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:35:18,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:35:18,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:18,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:18,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:18,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:18,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343949907] [2025-02-08 08:35:18,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343949907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:18,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:18,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:18,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15783181] [2025-02-08 08:35:18,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:18,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:35:18,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:18,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:35:18,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:35:18,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:18,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 239 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-02-08 08:35:18,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:18,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:18,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:18,424 INFO L124 PetriNetUnfolderBase]: 154/542 cut-off events. [2025-02-08 08:35:18,425 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 08:35:18,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 542 events. 154/542 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3447 event pairs, 110 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 820. Up to 271 conditions per place. [2025-02-08 08:35:18,431 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 40 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-02-08 08:35:18,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 324 flow [2025-02-08 08:35:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:35:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:35:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-02-08 08:35:18,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684375 [2025-02-08 08:35:18,432 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 239 flow. Second operand 4 states and 219 transitions. [2025-02-08 08:35:18,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 324 flow [2025-02-08 08:35:18,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 81 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:18,434 INFO L231 Difference]: Finished difference. Result has 82 places, 80 transitions, 237 flow [2025-02-08 08:35:18,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=82, PETRI_TRANSITIONS=80} [2025-02-08 08:35:18,439 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-02-08 08:35:18,439 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 80 transitions, 237 flow [2025-02-08 08:35:18,439 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-02-08 08:35:18,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:18,439 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:18,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:35:18,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:18,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1283013102, now seen corresponding path program 1 times [2025-02-08 08:35:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:18,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528526095] [2025-02-08 08:35:18,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:18,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:18,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:35:18,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:35:18,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:18,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:18,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528526095] [2025-02-08 08:35:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528526095] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:18,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24074406] [2025-02-08 08:35:18,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:18,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:18,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:18,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 08:35:18,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:35:18,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:35:18,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:18,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:18,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:35:18,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:18,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:18,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24074406] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:18,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-02-08 08:35:18,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241303336] [2025-02-08 08:35:18,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:18,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:35:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:18,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:35:18,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:35:18,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:18,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 80 transitions, 237 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-02-08 08:35:18,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:18,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:18,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:19,134 INFO L124 PetriNetUnfolderBase]: 304/1072 cut-off events. [2025-02-08 08:35:19,134 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-08 08:35:19,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1072 events. 304/1072 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8308 event pairs, 220 based on Foata normal form. 1/792 useless extension candidates. Maximal degree in co-relation 822. Up to 266 conditions per place. [2025-02-08 08:35:19,139 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 55 selfloop transitions, 21 changer transitions 0/113 dead transitions. [2025-02-08 08:35:19,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 489 flow [2025-02-08 08:35:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:35:19,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 08:35:19,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 481 transitions. [2025-02-08 08:35:19,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6680555555555555 [2025-02-08 08:35:19,141 INFO L175 Difference]: Start difference. First operand has 82 places, 80 transitions, 237 flow. Second operand 9 states and 481 transitions. [2025-02-08 08:35:19,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 489 flow [2025-02-08 08:35:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 113 transitions, 475 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:19,143 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 350 flow [2025-02-08 08:35:19,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=350, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2025-02-08 08:35:19,144 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-02-08 08:35:19,144 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 350 flow [2025-02-08 08:35:19,144 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-02-08 08:35:19,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:19,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:19,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 08:35:19,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 08:35:19,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:19,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1118703324, now seen corresponding path program 1 times [2025-02-08 08:35:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053558923] [2025-02-08 08:35:19,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:19,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 08:35:19,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 08:35:19,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:19,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:19,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:35:19,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:19,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053558923] [2025-02-08 08:35:19,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053558923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:19,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:19,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:19,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708331392] [2025-02-08 08:35:19,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:19,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:35:19,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:19,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:35:19,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:35:19,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:19,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 350 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-02-08 08:35:19,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:19,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:19,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:19,693 INFO L124 PetriNetUnfolderBase]: 304/1076 cut-off events. [2025-02-08 08:35:19,693 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 08:35:19,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 1076 events. 304/1076 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8217 event pairs, 220 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 840. Up to 540 conditions per place. [2025-02-08 08:35:19,698 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 53 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2025-02-08 08:35:19,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 468 flow [2025-02-08 08:35:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:35:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:35:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 214 transitions. [2025-02-08 08:35:19,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-02-08 08:35:19,699 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 350 flow. Second operand 4 states and 214 transitions. [2025-02-08 08:35:19,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 468 flow [2025-02-08 08:35:19,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 464 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 08:35:19,701 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 365 flow [2025-02-08 08:35:19,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2025-02-08 08:35:19,701 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 16 predicate places. [2025-02-08 08:35:19,701 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 365 flow [2025-02-08 08:35:19,704 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-02-08 08:35:19,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:19,705 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:19,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:35:19,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:19,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1135942574, now seen corresponding path program 2 times [2025-02-08 08:35:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:19,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123742171] [2025-02-08 08:35:19,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:19,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-08 08:35:19,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:35:19,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:35:19,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 08:35:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123742171] [2025-02-08 08:35:19,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123742171] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:19,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621032388] [2025-02-08 08:35:19,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:19,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:19,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:19,867 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:19,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 08:35:19,910 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-08 08:35:19,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 08:35:19,932 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:35:19,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:19,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 08:35:19,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:20,001 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-02-08 08:35:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:20,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:20,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:20,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621032388] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:20,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:20,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2025-02-08 08:35:20,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835174481] [2025-02-08 08:35:20,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:20,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:35:20,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:20,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:35:20,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:35:20,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:20,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 365 flow. Second operand has 16 states, 16 states have (on average 46.3125) internal successors, (741), 16 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:20,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:20,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:20,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:21,223 INFO L124 PetriNetUnfolderBase]: 305/1078 cut-off events. [2025-02-08 08:35:21,223 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-02-08 08:35:21,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 1078 events. 305/1078 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8229 event pairs, 220 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 854. Up to 267 conditions per place. [2025-02-08 08:35:21,228 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 66 selfloop transitions, 18 changer transitions 0/119 dead transitions. [2025-02-08 08:35:21,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 119 transitions, 615 flow [2025-02-08 08:35:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:35:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 08:35:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 690 transitions. [2025-02-08 08:35:21,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160714285714286 [2025-02-08 08:35:21,230 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 365 flow. Second operand 14 states and 690 transitions. [2025-02-08 08:35:21,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 119 transitions, 615 flow [2025-02-08 08:35:21,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 119 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:21,233 INFO L231 Difference]: Finished difference. Result has 106 places, 94 transitions, 423 flow [2025-02-08 08:35:21,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=423, PETRI_PLACES=106, PETRI_TRANSITIONS=94} [2025-02-08 08:35:21,234 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2025-02-08 08:35:21,234 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 94 transitions, 423 flow [2025-02-08 08:35:21,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 46.3125) internal successors, (741), 16 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:21,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:21,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:21,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 08:35:21,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 08:35:21,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:21,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:21,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1332097153, now seen corresponding path program 1 times [2025-02-08 08:35:21,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98989297] [2025-02-08 08:35:21,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:21,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:21,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:35:21,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:35:21,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:21,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98989297] [2025-02-08 08:35:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98989297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863306403] [2025-02-08 08:35:21,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:21,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:21,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 08:35:21,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 08:35:21,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 08:35:21,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:21,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:21,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 08:35:21,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:21,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863306403] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:21,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-08 08:35:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746154308] [2025-02-08 08:35:21,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:21,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:35:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:21,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:35:21,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:35:21,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:21,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 94 transitions, 423 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-02-08 08:35:21,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:21,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:21,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:22,189 INFO L124 PetriNetUnfolderBase]: 601/2125 cut-off events. [2025-02-08 08:35:22,189 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-02-08 08:35:22,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3386 conditions, 2125 events. 601/2125 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 19366 event pairs, 440 based on Foata normal form. 2/1573 useless extension candidates. Maximal degree in co-relation 1727. Up to 529 conditions per place. [2025-02-08 08:35:22,199 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 67 selfloop transitions, 23 changer transitions 0/126 dead transitions. [2025-02-08 08:35:22,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 126 transitions, 740 flow [2025-02-08 08:35:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:22,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 432 transitions. [2025-02-08 08:35:22,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-02-08 08:35:22,203 INFO L175 Difference]: Start difference. First operand has 106 places, 94 transitions, 423 flow. Second operand 8 states and 432 transitions. [2025-02-08 08:35:22,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 126 transitions, 740 flow [2025-02-08 08:35:22,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 126 transitions, 656 flow, removed 18 selfloop flow, removed 10 redundant places. [2025-02-08 08:35:22,206 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 465 flow [2025-02-08 08:35:22,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=465, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2025-02-08 08:35:22,207 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2025-02-08 08:35:22,208 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 465 flow [2025-02-08 08:35:22,208 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-02-08 08:35:22,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:22,208 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:22,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 08:35:22,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-08 08:35:22,409 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1184297742, now seen corresponding path program 2 times [2025-02-08 08:35:22,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:22,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387930899] [2025-02-08 08:35:22,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:22,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 08:35:22,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:35:22,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:35:22,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 08:35:22,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:22,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387930899] [2025-02-08 08:35:22,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387930899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:22,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872701053] [2025-02-08 08:35:22,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:22,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:22,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:22,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:22,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 08:35:22,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 08:35:22,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:35:22,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:35:22,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:22,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 08:35:22,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:22,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:22,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 36 [2025-02-08 08:35:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:22,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:22,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872701053] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:22,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:22,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-02-08 08:35:22,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619564105] [2025-02-08 08:35:22,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:22,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:35:22,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:22,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:35:22,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:35:23,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:23,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 465 flow. Second operand has 17 states, 17 states have (on average 46.529411764705884) internal successors, (791), 17 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:23,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:23,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:23,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:23,972 INFO L124 PetriNetUnfolderBase]: 603/2129 cut-off events. [2025-02-08 08:35:23,972 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-02-08 08:35:23,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3406 conditions, 2129 events. 603/2129 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 19385 event pairs, 440 based on Foata normal form. 0/1574 useless extension candidates. Maximal degree in co-relation 1740. Up to 518 conditions per place. [2025-02-08 08:35:23,982 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 68 selfloop transitions, 26 changer transitions 0/129 dead transitions. [2025-02-08 08:35:23,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 129 transitions, 750 flow [2025-02-08 08:35:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:35:23,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 08:35:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 685 transitions. [2025-02-08 08:35:23,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6116071428571429 [2025-02-08 08:35:23,984 INFO L175 Difference]: Start difference. First operand has 106 places, 99 transitions, 465 flow. Second operand 14 states and 685 transitions. [2025-02-08 08:35:23,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 129 transitions, 750 flow [2025-02-08 08:35:23,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 129 transitions, 724 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:23,987 INFO L231 Difference]: Finished difference. Result has 118 places, 102 transitions, 517 flow [2025-02-08 08:35:23,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=517, PETRI_PLACES=118, PETRI_TRANSITIONS=102} [2025-02-08 08:35:23,987 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 40 predicate places. [2025-02-08 08:35:23,988 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 102 transitions, 517 flow [2025-02-08 08:35:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 46.529411764705884) internal successors, (791), 17 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:23,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:23,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:23,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 08:35:24,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:24,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:24,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:24,193 INFO L85 PathProgramCache]: Analyzing trace with hash 245221659, now seen corresponding path program 1 times [2025-02-08 08:35:24,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:24,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388316676] [2025-02-08 08:35:24,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:24,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:24,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:35:24,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:35:24,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:24,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:24,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:35:24,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:24,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388316676] [2025-02-08 08:35:24,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388316676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:24,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:24,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:24,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011874617] [2025-02-08 08:35:24,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:35:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:24,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:35:24,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:35:24,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 80 [2025-02-08 08:35:24,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 102 transitions, 517 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-02-08 08:35:24,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:24,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 80 [2025-02-08 08:35:24,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:24,660 INFO L124 PetriNetUnfolderBase]: 695/2173 cut-off events. [2025-02-08 08:35:24,661 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2025-02-08 08:35:24,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3647 conditions, 2173 events. 695/2173 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 18788 event pairs, 516 based on Foata normal form. 0/1753 useless extension candidates. Maximal degree in co-relation 1911. Up to 1200 conditions per place. [2025-02-08 08:35:24,673 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 61 selfloop transitions, 7 changer transitions 0/98 dead transitions. [2025-02-08 08:35:24,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 98 transitions, 645 flow [2025-02-08 08:35:24,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:35:24,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:35:24,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 232 transitions. [2025-02-08 08:35:24,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.58 [2025-02-08 08:35:24,674 INFO L175 Difference]: Start difference. First operand has 118 places, 102 transitions, 517 flow. Second operand 5 states and 232 transitions. [2025-02-08 08:35:24,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 98 transitions, 645 flow [2025-02-08 08:35:24,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 98 transitions, 556 flow, removed 11 selfloop flow, removed 12 redundant places. [2025-02-08 08:35:24,679 INFO L231 Difference]: Finished difference. Result has 106 places, 98 transitions, 434 flow [2025-02-08 08:35:24,679 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=106, PETRI_TRANSITIONS=98} [2025-02-08 08:35:24,680 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2025-02-08 08:35:24,680 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 98 transitions, 434 flow [2025-02-08 08:35:24,680 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-02-08 08:35:24,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:24,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:24,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 08:35:24,680 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:24,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 245221660, now seen corresponding path program 1 times [2025-02-08 08:35:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416496367] [2025-02-08 08:35:24,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:24,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:35:24,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:35:24,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:24,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:25,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:25,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416496367] [2025-02-08 08:35:25,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416496367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:25,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297551265] [2025-02-08 08:35:25,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:25,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:25,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:25,010 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:25,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 08:35:25,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 08:35:25,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 08:35:25,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:25,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:25,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 08:35:25,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:25,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 08:35:25,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:25,148 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-02-08 08:35:25,165 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 08:35:25,166 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-02-08 08:35:25,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:25,227 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-02-08 08:35:25,254 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-08 08:35:25,254 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-02-08 08:35:25,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:25,295 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-02-08 08:35:25,303 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 08:35:25,304 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-02-08 08:35:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:35:25,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:35:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297551265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:25,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:35:25,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 9 [2025-02-08 08:35:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286119448] [2025-02-08 08:35:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:25,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:35:25,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:25,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:35:25,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:35:25,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 80 [2025-02-08 08:35:25,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 98 transitions, 434 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-02-08 08:35:25,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:25,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 80 [2025-02-08 08:35:25,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:25,676 INFO L124 PetriNetUnfolderBase]: 603/1921 cut-off events. [2025-02-08 08:35:25,676 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 08:35:25,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3185 conditions, 1921 events. 603/1921 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16316 event pairs, 440 based on Foata normal form. 80/1579 useless extension candidates. Maximal degree in co-relation 1674. Up to 1058 conditions per place. [2025-02-08 08:35:25,684 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 64 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2025-02-08 08:35:25,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 94 transitions, 560 flow [2025-02-08 08:35:25,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:35:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:35:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2025-02-08 08:35:25,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-08 08:35:25,686 INFO L175 Difference]: Start difference. First operand has 106 places, 98 transitions, 434 flow. Second operand 4 states and 180 transitions. [2025-02-08 08:35:25,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 94 transitions, 560 flow [2025-02-08 08:35:25,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 94 transitions, 550 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:25,688 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 422 flow [2025-02-08 08:35:25,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=422, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-02-08 08:35:25,688 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 24 predicate places. [2025-02-08 08:35:25,688 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 422 flow [2025-02-08 08:35:25,688 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-02-08 08:35:25,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:25,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:25,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:35:25,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 08:35:25,889 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:25,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:25,890 INFO L85 PathProgramCache]: Analyzing trace with hash -988062274, now seen corresponding path program 1 times [2025-02-08 08:35:25,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:25,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768005859] [2025-02-08 08:35:25,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:25,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:25,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:35:25,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:35:25,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:25,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768005859] [2025-02-08 08:35:26,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768005859] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026808057] [2025-02-08 08:35:26,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:26,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:26,117 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:26,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 08:35:26,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 08:35:26,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 08:35:26,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:26,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:26,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 08:35:26,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:26,214 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-02-08 08:35:26,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:26,268 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-02-08 08:35:26,279 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 08:35:26,280 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-02-08 08:35:26,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:26,320 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-02-08 08:35:26,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:35:26,331 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-02-08 08:35:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:35:26,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:35:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026808057] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:26,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:35:26,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2025-02-08 08:35:26,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498883208] [2025-02-08 08:35:26,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:26,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:35:26,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:26,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:35:26,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:35:26,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 80 [2025-02-08 08:35:26,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:26,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:26,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 80 [2025-02-08 08:35:26,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:26,655 INFO L124 PetriNetUnfolderBase]: 699/1809 cut-off events. [2025-02-08 08:35:26,655 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-02-08 08:35:26,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 1809 events. 699/1809 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13825 event pairs, 520 based on Foata normal form. 0/1551 useless extension candidates. Maximal degree in co-relation 1696. Up to 1200 conditions per place. [2025-02-08 08:35:26,661 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 61 selfloop transitions, 7 changer transitions 0/86 dead transitions. [2025-02-08 08:35:26,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 86 transitions, 542 flow [2025-02-08 08:35:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:35:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:35:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2025-02-08 08:35:26,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54 [2025-02-08 08:35:26,662 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 422 flow. Second operand 5 states and 216 transitions. [2025-02-08 08:35:26,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 86 transitions, 542 flow [2025-02-08 08:35:26,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 86 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:26,664 INFO L231 Difference]: Finished difference. Result has 96 places, 86 transitions, 416 flow [2025-02-08 08:35:26,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=416, PETRI_PLACES=96, PETRI_TRANSITIONS=86} [2025-02-08 08:35:26,665 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 18 predicate places. [2025-02-08 08:35:26,665 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 86 transitions, 416 flow [2025-02-08 08:35:26,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 37.285714285714285) internal successors, (261), 7 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:26,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:26,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:26,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:35:26,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:26,866 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:26,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash -565158561, now seen corresponding path program 1 times [2025-02-08 08:35:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:26,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118844418] [2025-02-08 08:35:26,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:26,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:35:26,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:35:26,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:26,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:35:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118844418] [2025-02-08 08:35:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118844418] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495523105] [2025-02-08 08:35:27,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:27,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:27,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:27,166 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:27,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 08:35:27,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:35:27,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:35:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:27,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 08:35:27,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:27,291 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-02-08 08:35:27,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:35:27,331 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-02-08 08:35:27,337 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:35:27,338 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-02-08 08:35:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:27,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:27,442 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-02-08 08:35:27,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:35:27,492 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-02-08 08:35:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495523105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:27,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-02-08 08:35:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395276801] [2025-02-08 08:35:27,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:27,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:35:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:27,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:35:27,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:35:28,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 80 [2025-02-08 08:35:28,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 86 transitions, 416 flow. Second operand has 19 states, 19 states have (on average 44.473684210526315) internal successors, (845), 19 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:28,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:28,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 80 [2025-02-08 08:35:28,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:28,994 INFO L124 PetriNetUnfolderBase]: 723/1967 cut-off events. [2025-02-08 08:35:28,994 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-02-08 08:35:28,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3465 conditions, 1967 events. 723/1967 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15475 event pairs, 368 based on Foata normal form. 0/1717 useless extension candidates. Maximal degree in co-relation 2001. Up to 501 conditions per place. [2025-02-08 08:35:29,001 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 82 selfloop transitions, 29 changer transitions 0/128 dead transitions. [2025-02-08 08:35:29,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 128 transitions, 766 flow [2025-02-08 08:35:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:35:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 08:35:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 632 transitions. [2025-02-08 08:35:29,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6076923076923076 [2025-02-08 08:35:29,005 INFO L175 Difference]: Start difference. First operand has 96 places, 86 transitions, 416 flow. Second operand 13 states and 632 transitions. [2025-02-08 08:35:29,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 128 transitions, 766 flow [2025-02-08 08:35:29,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 128 transitions, 756 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:29,007 INFO L231 Difference]: Finished difference. Result has 110 places, 93 transitions, 541 flow [2025-02-08 08:35:29,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=541, PETRI_PLACES=110, PETRI_TRANSITIONS=93} [2025-02-08 08:35:29,008 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2025-02-08 08:35:29,008 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 93 transitions, 541 flow [2025-02-08 08:35:29,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 44.473684210526315) internal successors, (845), 19 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:29,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:29,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:29,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 08:35:29,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 08:35:29,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:29,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:29,213 INFO L85 PathProgramCache]: Analyzing trace with hash -565158562, now seen corresponding path program 1 times [2025-02-08 08:35:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:29,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137134184] [2025-02-08 08:35:29,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:29,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:29,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 08:35:29,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 08:35:29,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:29,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137134184] [2025-02-08 08:35:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137134184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:35:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062944889] [2025-02-08 08:35:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:29,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:35:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:29,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:35:29,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:35:29,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 80 [2025-02-08 08:35:29,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 93 transitions, 541 flow. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:29,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:29,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 80 [2025-02-08 08:35:29,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:29,480 INFO L124 PetriNetUnfolderBase]: 657/1781 cut-off events. [2025-02-08 08:35:29,480 INFO L125 PetriNetUnfolderBase]: For 284/314 co-relation queries the response was YES. [2025-02-08 08:35:29,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 1781 events. 657/1781 cut-off events. For 284/314 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13747 event pairs, 484 based on Foata normal form. 120/1687 useless extension candidates. Maximal degree in co-relation 2082. Up to 1110 conditions per place. [2025-02-08 08:35:29,487 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 58 selfloop transitions, 16 changer transitions 0/91 dead transitions. [2025-02-08 08:35:29,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 91 transitions, 685 flow [2025-02-08 08:35:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:35:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:35:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 244 transitions. [2025-02-08 08:35:29,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-02-08 08:35:29,489 INFO L175 Difference]: Start difference. First operand has 110 places, 93 transitions, 541 flow. Second operand 5 states and 244 transitions. [2025-02-08 08:35:29,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 91 transitions, 685 flow [2025-02-08 08:35:29,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 91 transitions, 641 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 08:35:29,492 INFO L231 Difference]: Finished difference. Result has 104 places, 91 transitions, 525 flow [2025-02-08 08:35:29,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=525, PETRI_PLACES=104, PETRI_TRANSITIONS=91} [2025-02-08 08:35:29,493 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 26 predicate places. [2025-02-08 08:35:29,493 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 91 transitions, 525 flow [2025-02-08 08:35:29,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:29,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:29,493 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-02-08 08:35:29,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 08:35:29,493 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:29,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1951470237, now seen corresponding path program 1 times [2025-02-08 08:35:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:29,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698031079] [2025-02-08 08:35:29,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:29,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:29,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:35:29,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:35:29,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:29,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698031079] [2025-02-08 08:35:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698031079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:35:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260752707] [2025-02-08 08:35:29,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:29,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:29,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:35:29,679 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:35:29,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:35:29,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:35:29,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:35:29,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:29,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:29,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 08:35:29,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:35:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:29,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:35:29,943 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-02-08 08:35:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 08:35:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260752707] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 08:35:30,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 08:35:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-08 08:35:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993135519] [2025-02-08 08:35:30,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 08:35:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:35:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:30,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:35:30,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:35:30,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:30,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 91 transitions, 525 flow. Second operand has 19 states, 19 states have (on average 46.31578947368421) internal successors, (880), 19 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:30,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:30,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:30,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:30,932 INFO L124 PetriNetUnfolderBase]: 779/2003 cut-off events. [2025-02-08 08:35:30,932 INFO L125 PetriNetUnfolderBase]: For 319/348 co-relation queries the response was YES. [2025-02-08 08:35:30,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3918 conditions, 2003 events. 779/2003 cut-off events. For 319/348 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15452 event pairs, 400 based on Foata normal form. 0/1823 useless extension candidates. Maximal degree in co-relation 2327. Up to 554 conditions per place. [2025-02-08 08:35:30,938 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 90 selfloop transitions, 29 changer transitions 0/134 dead transitions. [2025-02-08 08:35:30,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 902 flow [2025-02-08 08:35:30,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:35:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 08:35:30,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 568 transitions. [2025-02-08 08:35:30,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6454545454545455 [2025-02-08 08:35:30,940 INFO L175 Difference]: Start difference. First operand has 104 places, 91 transitions, 525 flow. Second operand 11 states and 568 transitions. [2025-02-08 08:35:30,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 902 flow [2025-02-08 08:35:30,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 134 transitions, 876 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:30,943 INFO L231 Difference]: Finished difference. Result has 115 places, 95 transitions, 609 flow [2025-02-08 08:35:30,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=609, PETRI_PLACES=115, PETRI_TRANSITIONS=95} [2025-02-08 08:35:30,944 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 37 predicate places. [2025-02-08 08:35:30,944 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 95 transitions, 609 flow [2025-02-08 08:35:30,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 46.31578947368421) internal successors, (880), 19 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:30,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:30,945 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-02-08 08:35:30,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 08:35:31,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:35:31,145 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:31,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:31,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1951470238, now seen corresponding path program 1 times [2025-02-08 08:35:31,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:31,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74818006] [2025-02-08 08:35:31,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:31,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 08:35:31,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 08:35:31,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:31,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 08:35:31,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:31,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74818006] [2025-02-08 08:35:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74818006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:31,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373319301] [2025-02-08 08:35:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:31,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:35:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:31,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:35:31,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:35:31,256 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 80 [2025-02-08 08:35:31,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 95 transitions, 609 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:31,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:31,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 80 [2025-02-08 08:35:31,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:31,396 INFO L124 PetriNetUnfolderBase]: 741/1881 cut-off events. [2025-02-08 08:35:31,396 INFO L125 PetriNetUnfolderBase]: For 519/557 co-relation queries the response was YES. [2025-02-08 08:35:31,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 1881 events. 741/1881 cut-off events. For 519/557 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14110 event pairs, 561 based on Foata normal form. 130/1877 useless extension candidates. Maximal degree in co-relation 2392. Up to 1272 conditions per place. [2025-02-08 08:35:31,403 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 68 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2025-02-08 08:35:31,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 93 transitions, 761 flow [2025-02-08 08:35:31,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:35:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 08:35:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2025-02-08 08:35:31,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.63125 [2025-02-08 08:35:31,404 INFO L175 Difference]: Start difference. First operand has 115 places, 95 transitions, 609 flow. Second operand 4 states and 202 transitions. [2025-02-08 08:35:31,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 93 transitions, 761 flow [2025-02-08 08:35:31,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 93 transitions, 735 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 08:35:31,407 INFO L231 Difference]: Finished difference. Result has 111 places, 93 transitions, 599 flow [2025-02-08 08:35:31,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=599, PETRI_PLACES=111, PETRI_TRANSITIONS=93} [2025-02-08 08:35:31,408 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2025-02-08 08:35:31,408 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 93 transitions, 599 flow [2025-02-08 08:35:31,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:31,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:31,409 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:35:31,409 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1294006907, now seen corresponding path program 2 times [2025-02-08 08:35:31,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:31,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348862230] [2025-02-08 08:35:31,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:31,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-02-08 08:35:31,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 20 statements. [2025-02-08 08:35:31,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:35:31,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:35:31,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:31,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348862230] [2025-02-08 08:35:31,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348862230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:31,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:31,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:35:31,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104018577] [2025-02-08 08:35:31,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:31,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:35:31,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:31,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:35:31,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:35:31,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 80 [2025-02-08 08:35:31,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 93 transitions, 599 flow. Second operand has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:31,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:31,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 80 [2025-02-08 08:35:31,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:32,237 INFO L124 PetriNetUnfolderBase]: 841/1939 cut-off events. [2025-02-08 08:35:32,237 INFO L125 PetriNetUnfolderBase]: For 574/584 co-relation queries the response was YES. [2025-02-08 08:35:32,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4189 conditions, 1939 events. 841/1939 cut-off events. For 574/584 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13765 event pairs, 234 based on Foata normal form. 40/1874 useless extension candidates. Maximal degree in co-relation 2578. Up to 1402 conditions per place. [2025-02-08 08:35:32,244 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 70 selfloop transitions, 15 changer transitions 0/97 dead transitions. [2025-02-08 08:35:32,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 97 transitions, 770 flow [2025-02-08 08:35:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 08:35:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-08 08:35:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2025-02-08 08:35:32,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2025-02-08 08:35:32,246 INFO L175 Difference]: Start difference. First operand has 111 places, 93 transitions, 599 flow. Second operand 7 states and 328 transitions. [2025-02-08 08:35:32,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 97 transitions, 770 flow [2025-02-08 08:35:32,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 751 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 08:35:32,250 INFO L231 Difference]: Finished difference. Result has 112 places, 93 transitions, 614 flow [2025-02-08 08:35:32,250 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=105, 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=7, PETRI_FLOW=614, PETRI_PLACES=112, PETRI_TRANSITIONS=93} [2025-02-08 08:35:32,250 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 34 predicate places. [2025-02-08 08:35:32,250 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 93 transitions, 614 flow [2025-02-08 08:35:32,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.42857142857143) internal successors, (304), 7 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:32,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:32,251 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-02-08 08:35:32,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 08:35:32,251 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:32,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:32,251 INFO L85 PathProgramCache]: Analyzing trace with hash 549253396, now seen corresponding path program 2 times [2025-02-08 08:35:32,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:32,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988891920] [2025-02-08 08:35:32,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:32,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:32,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-02-08 08:35:32,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 22 statements. [2025-02-08 08:35:32,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:35:32,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 08:35:32,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:32,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988891920] [2025-02-08 08:35:32,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988891920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:32,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:32,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879966765] [2025-02-08 08:35:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:32,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:35:32,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:32,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:35:32,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:35:32,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 80 [2025-02-08 08:35:32,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 93 transitions, 614 flow. Second operand has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:32,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:32,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 80 [2025-02-08 08:35:32,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:32,622 INFO L124 PetriNetUnfolderBase]: 705/1673 cut-off events. [2025-02-08 08:35:32,622 INFO L125 PetriNetUnfolderBase]: For 532/532 co-relation queries the response was YES. [2025-02-08 08:35:32,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3717 conditions, 1673 events. 705/1673 cut-off events. For 532/532 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11685 event pairs, 492 based on Foata normal form. 42/1603 useless extension candidates. Maximal degree in co-relation 2419. Up to 1194 conditions per place. [2025-02-08 08:35:32,628 INFO L140 encePairwiseOnDemand]: 75/80 looper letters, 65 selfloop transitions, 13 changer transitions 2/91 dead transitions. [2025-02-08 08:35:32,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 91 transitions, 762 flow [2025-02-08 08:35:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:35:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 08:35:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 254 transitions. [2025-02-08 08:35:32,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.635 [2025-02-08 08:35:32,629 INFO L175 Difference]: Start difference. First operand has 112 places, 93 transitions, 614 flow. Second operand 5 states and 254 transitions. [2025-02-08 08:35:32,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 91 transitions, 762 flow [2025-02-08 08:35:32,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 91 transitions, 738 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 08:35:32,634 INFO L231 Difference]: Finished difference. Result has 108 places, 89 transitions, 600 flow [2025-02-08 08:35:32,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=600, PETRI_PLACES=108, PETRI_TRANSITIONS=89} [2025-02-08 08:35:32,635 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 30 predicate places. [2025-02-08 08:35:32,635 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 89 transitions, 600 flow [2025-02-08 08:35:32,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.6) internal successors, (238), 5 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:32,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:32,636 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] [2025-02-08 08:35:32,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 08:35:32,636 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:32,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:32,637 INFO L85 PathProgramCache]: Analyzing trace with hash -953586430, now seen corresponding path program 1 times [2025-02-08 08:35:32,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:32,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979986259] [2025-02-08 08:35:32,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:32,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 08:35:32,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 08:35:32,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:32,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:32,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:32,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979986259] [2025-02-08 08:35:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979986259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85929394] [2025-02-08 08:35:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:32,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:35:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:32,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:35:32,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:35:32,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-02-08 08:35:32,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 89 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:32,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:32,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-02-08 08:35:32,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:32,799 INFO L124 PetriNetUnfolderBase]: 711/1637 cut-off events. [2025-02-08 08:35:32,799 INFO L125 PetriNetUnfolderBase]: For 379/379 co-relation queries the response was YES. [2025-02-08 08:35:32,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3743 conditions, 1637 events. 711/1637 cut-off events. For 379/379 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10992 event pairs, 400 based on Foata normal form. 0/1472 useless extension candidates. Maximal degree in co-relation 1944. Up to 964 conditions per place. [2025-02-08 08:35:32,805 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 79 selfloop transitions, 0 changer transitions 13/99 dead transitions. [2025-02-08 08:35:32,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 99 transitions, 812 flow [2025-02-08 08:35:32,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:35:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:35:32,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2025-02-08 08:35:32,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-02-08 08:35:32,806 INFO L175 Difference]: Start difference. First operand has 108 places, 89 transitions, 600 flow. Second operand 3 states and 172 transitions. [2025-02-08 08:35:32,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 99 transitions, 812 flow [2025-02-08 08:35:32,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 99 transitions, 792 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:32,809 INFO L231 Difference]: Finished difference. Result has 106 places, 86 transitions, 576 flow [2025-02-08 08:35:32,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=106, PETRI_TRANSITIONS=86} [2025-02-08 08:35:32,809 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 28 predicate places. [2025-02-08 08:35:32,809 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 576 flow [2025-02-08 08:35:32,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:32,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:32,810 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] [2025-02-08 08:35:32,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 08:35:32,810 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:32,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1633580887, now seen corresponding path program 1 times [2025-02-08 08:35:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713787599] [2025-02-08 08:35:32,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:32,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:32,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 08:35:32,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 08:35:32,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:32,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:32,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:32,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713787599] [2025-02-08 08:35:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713787599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:35:32,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827562363] [2025-02-08 08:35:32,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:32,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:35:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:32,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:35:32,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:35:32,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 80 [2025-02-08 08:35:32,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:32,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:32,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 80 [2025-02-08 08:35:32,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:32,950 INFO L124 PetriNetUnfolderBase]: 673/1375 cut-off events. [2025-02-08 08:35:32,951 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2025-02-08 08:35:32,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3511 conditions, 1375 events. 673/1375 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7799 event pairs, 404 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 3494. Up to 958 conditions per place. [2025-02-08 08:35:32,956 INFO L140 encePairwiseOnDemand]: 77/80 looper letters, 79 selfloop transitions, 0 changer transitions 12/95 dead transitions. [2025-02-08 08:35:32,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 95 transitions, 786 flow [2025-02-08 08:35:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:35:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 08:35:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2025-02-08 08:35:32,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7125 [2025-02-08 08:35:32,957 INFO L175 Difference]: Start difference. First operand has 106 places, 86 transitions, 576 flow. Second operand 3 states and 171 transitions. [2025-02-08 08:35:32,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 95 transitions, 786 flow [2025-02-08 08:35:32,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 95 transitions, 782 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 08:35:32,961 INFO L231 Difference]: Finished difference. Result has 105 places, 83 transitions, 570 flow [2025-02-08 08:35:32,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=105, PETRI_TRANSITIONS=83} [2025-02-08 08:35:32,961 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2025-02-08 08:35:32,961 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 83 transitions, 570 flow [2025-02-08 08:35:32,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:32,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:32,962 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-02-08 08:35:32,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:35:32,962 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:32,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash -847000241, now seen corresponding path program 1 times [2025-02-08 08:35:32,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:32,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062354872] [2025-02-08 08:35:32,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:35:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:32,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:35:32,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:35:32,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:32,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:33,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062354872] [2025-02-08 08:35:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062354872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607817544] [2025-02-08 08:35:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:33,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:33,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:33,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:33,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:33,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 83 transitions, 570 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:33,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:33,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:33,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:33,815 INFO L124 PetriNetUnfolderBase]: 987/2269 cut-off events. [2025-02-08 08:35:33,815 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2025-02-08 08:35:33,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5856 conditions, 2269 events. 987/2269 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16200 event pairs, 178 based on Foata normal form. 4/2272 useless extension candidates. Maximal degree in co-relation 5838. Up to 648 conditions per place. [2025-02-08 08:35:33,822 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 130 selfloop transitions, 6 changer transitions 6/147 dead transitions. [2025-02-08 08:35:33,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 147 transitions, 1081 flow [2025-02-08 08:35:33,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 450 transitions. [2025-02-08 08:35:33,823 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2025-02-08 08:35:33,823 INFO L175 Difference]: Start difference. First operand has 105 places, 83 transitions, 570 flow. Second operand 8 states and 450 transitions. [2025-02-08 08:35:33,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 147 transitions, 1081 flow [2025-02-08 08:35:33,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 147 transitions, 1069 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-08 08:35:33,829 INFO L231 Difference]: Finished difference. Result has 114 places, 87 transitions, 612 flow [2025-02-08 08:35:33,829 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=612, PETRI_PLACES=114, PETRI_TRANSITIONS=87} [2025-02-08 08:35:33,829 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 36 predicate places. [2025-02-08 08:35:33,829 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 87 transitions, 612 flow [2025-02-08 08:35:33,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:33,830 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:33,830 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-02-08 08:35:33,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 08:35:33,830 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:33,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash -779353225, now seen corresponding path program 2 times [2025-02-08 08:35:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:33,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632162827] [2025-02-08 08:35:33,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:33,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:33,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:33,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:35:33,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:34,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:34,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:34,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632162827] [2025-02-08 08:35:34,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632162827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:34,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:34,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:34,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554452412] [2025-02-08 08:35:34,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:34,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:34,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:34,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:34,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:34,234 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:34,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 87 transitions, 612 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:34,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:34,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:34,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:34,708 INFO L124 PetriNetUnfolderBase]: 1135/2675 cut-off events. [2025-02-08 08:35:34,708 INFO L125 PetriNetUnfolderBase]: For 1803/1811 co-relation queries the response was YES. [2025-02-08 08:35:34,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7552 conditions, 2675 events. 1135/2675 cut-off events. For 1803/1811 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20386 event pairs, 238 based on Foata normal form. 4/2670 useless extension candidates. Maximal degree in co-relation 7528. Up to 1296 conditions per place. [2025-02-08 08:35:34,718 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 124 selfloop transitions, 7 changer transitions 6/142 dead transitions. [2025-02-08 08:35:34,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 142 transitions, 1105 flow [2025-02-08 08:35:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:34,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 443 transitions. [2025-02-08 08:35:34,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6921875 [2025-02-08 08:35:34,720 INFO L175 Difference]: Start difference. First operand has 114 places, 87 transitions, 612 flow. Second operand 8 states and 443 transitions. [2025-02-08 08:35:34,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 142 transitions, 1105 flow [2025-02-08 08:35:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 142 transitions, 1092 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:34,726 INFO L231 Difference]: Finished difference. Result has 124 places, 91 transitions, 665 flow [2025-02-08 08:35:34,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=665, PETRI_PLACES=124, PETRI_TRANSITIONS=91} [2025-02-08 08:35:34,726 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 46 predicate places. [2025-02-08 08:35:34,726 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 91 transitions, 665 flow [2025-02-08 08:35:34,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:34,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:34,727 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-02-08 08:35:34,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 08:35:34,728 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:34,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:34,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1362277529, now seen corresponding path program 3 times [2025-02-08 08:35:34,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:34,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715294578] [2025-02-08 08:35:34,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:35:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:34,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:34,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:34,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:35:34,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:35,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715294578] [2025-02-08 08:35:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715294578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:35,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377705504] [2025-02-08 08:35:35,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:35,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:35,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:35,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:35,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:35,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:35,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 91 transitions, 665 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:35,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:35,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:35,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:35,705 INFO L124 PetriNetUnfolderBase]: 1155/2737 cut-off events. [2025-02-08 08:35:35,705 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2025-02-08 08:35:35,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8495 conditions, 2737 events. 1155/2737 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21251 event pairs, 224 based on Foata normal form. 4/2740 useless extension candidates. Maximal degree in co-relation 8466. Up to 1264 conditions per place. [2025-02-08 08:35:35,718 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 102 selfloop transitions, 9 changer transitions 14/130 dead transitions. [2025-02-08 08:35:35,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 130 transitions, 1088 flow [2025-02-08 08:35:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 434 transitions. [2025-02-08 08:35:35,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.678125 [2025-02-08 08:35:35,720 INFO L175 Difference]: Start difference. First operand has 124 places, 91 transitions, 665 flow. Second operand 8 states and 434 transitions. [2025-02-08 08:35:35,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 130 transitions, 1088 flow [2025-02-08 08:35:35,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 1070 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-02-08 08:35:35,728 INFO L231 Difference]: Finished difference. Result has 132 places, 91 transitions, 682 flow [2025-02-08 08:35:35,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=682, PETRI_PLACES=132, PETRI_TRANSITIONS=91} [2025-02-08 08:35:35,729 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 54 predicate places. [2025-02-08 08:35:35,729 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 91 transitions, 682 flow [2025-02-08 08:35:35,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:35,729 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:35,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] [2025-02-08 08:35:35,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 08:35:35,729 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:35,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:35,730 INFO L85 PathProgramCache]: Analyzing trace with hash -881012067, now seen corresponding path program 4 times [2025-02-08 08:35:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872832376] [2025-02-08 08:35:35,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:35:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:35,737 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:35,740 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 35 statements. [2025-02-08 08:35:35,740 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:35:35,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:35,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:35,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872832376] [2025-02-08 08:35:35,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872832376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:35,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:35,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348112209] [2025-02-08 08:35:35,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:35,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:35,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:35,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:36,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:36,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 91 transitions, 682 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:36,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:36,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:36,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:36,436 INFO L124 PetriNetUnfolderBase]: 1111/2633 cut-off events. [2025-02-08 08:35:36,437 INFO L125 PetriNetUnfolderBase]: For 4657/4657 co-relation queries the response was YES. [2025-02-08 08:35:36,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8678 conditions, 2633 events. 1111/2633 cut-off events. For 4657/4657 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 20255 event pairs, 180 based on Foata normal form. 4/2636 useless extension candidates. Maximal degree in co-relation 8646. Up to 1652 conditions per place. [2025-02-08 08:35:36,447 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 118 selfloop transitions, 9 changer transitions 6/138 dead transitions. [2025-02-08 08:35:36,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 138 transitions, 1161 flow [2025-02-08 08:35:36,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 439 transitions. [2025-02-08 08:35:36,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6859375 [2025-02-08 08:35:36,449 INFO L175 Difference]: Start difference. First operand has 132 places, 91 transitions, 682 flow. Second operand 8 states and 439 transitions. [2025-02-08 08:35:36,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 138 transitions, 1161 flow [2025-02-08 08:35:36,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 138 transitions, 1127 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 08:35:36,458 INFO L231 Difference]: Finished difference. Result has 135 places, 94 transitions, 722 flow [2025-02-08 08:35:36,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=722, PETRI_PLACES=135, PETRI_TRANSITIONS=94} [2025-02-08 08:35:36,459 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 57 predicate places. [2025-02-08 08:35:36,459 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 94 transitions, 722 flow [2025-02-08 08:35:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:36,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:36,459 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-02-08 08:35:36,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 08:35:36,459 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1131481513, now seen corresponding path program 5 times [2025-02-08 08:35:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339635317] [2025-02-08 08:35:36,460 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:35:36,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:36,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:36,475 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:35:36,475 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:35:36,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:36,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:36,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339635317] [2025-02-08 08:35:36,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339635317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:36,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705359754] [2025-02-08 08:35:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:36,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:36,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:36,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:36,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:37,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:37,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 94 transitions, 722 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:37,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:37,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:37,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:37,613 INFO L124 PetriNetUnfolderBase]: 1127/2685 cut-off events. [2025-02-08 08:35:37,613 INFO L125 PetriNetUnfolderBase]: For 5081/5081 co-relation queries the response was YES. [2025-02-08 08:35:37,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9088 conditions, 2685 events. 1127/2685 cut-off events. For 5081/5081 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20830 event pairs, 184 based on Foata normal form. 4/2688 useless extension candidates. Maximal degree in co-relation 9054. Up to 1652 conditions per place. [2025-02-08 08:35:37,630 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 113 selfloop transitions, 8 changer transitions 10/136 dead transitions. [2025-02-08 08:35:37,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 136 transitions, 1171 flow [2025-02-08 08:35:37,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 439 transitions. [2025-02-08 08:35:37,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6859375 [2025-02-08 08:35:37,632 INFO L175 Difference]: Start difference. First operand has 135 places, 94 transitions, 722 flow. Second operand 8 states and 439 transitions. [2025-02-08 08:35:37,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 136 transitions, 1171 flow [2025-02-08 08:35:37,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 136 transitions, 1134 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:37,651 INFO L231 Difference]: Finished difference. Result has 142 places, 95 transitions, 738 flow [2025-02-08 08:35:37,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=738, PETRI_PLACES=142, PETRI_TRANSITIONS=95} [2025-02-08 08:35:37,652 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 64 predicate places. [2025-02-08 08:35:37,652 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 95 transitions, 738 flow [2025-02-08 08:35:37,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:37,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:37,652 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-02-08 08:35:37,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 08:35:37,652 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:37,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:37,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1234409825, now seen corresponding path program 6 times [2025-02-08 08:35:37,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:37,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967619553] [2025-02-08 08:35:37,653 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:35:37,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:37,663 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:37,669 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:37,669 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:35:37,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:37,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:37,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967619553] [2025-02-08 08:35:37,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967619553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:37,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:37,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:37,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761471171] [2025-02-08 08:35:37,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:37,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:37,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:37,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:38,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:38,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 95 transitions, 738 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:38,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:38,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:38,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:38,474 INFO L124 PetriNetUnfolderBase]: 1095/2589 cut-off events. [2025-02-08 08:35:38,475 INFO L125 PetriNetUnfolderBase]: For 5705/5705 co-relation queries the response was YES. [2025-02-08 08:35:38,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8967 conditions, 2589 events. 1095/2589 cut-off events. For 5705/5705 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 19938 event pairs, 180 based on Foata normal form. 4/2592 useless extension candidates. Maximal degree in co-relation 8930. Up to 1652 conditions per place. [2025-02-08 08:35:38,489 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 94 selfloop transitions, 5 changer transitions 31/135 dead transitions. [2025-02-08 08:35:38,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 135 transitions, 1168 flow [2025-02-08 08:35:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 436 transitions. [2025-02-08 08:35:38,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68125 [2025-02-08 08:35:38,490 INFO L175 Difference]: Start difference. First operand has 142 places, 95 transitions, 738 flow. Second operand 8 states and 436 transitions. [2025-02-08 08:35:38,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 135 transitions, 1168 flow [2025-02-08 08:35:38,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 135 transitions, 1141 flow, removed 7 selfloop flow, removed 5 redundant places. [2025-02-08 08:35:38,502 INFO L231 Difference]: Finished difference. Result has 143 places, 90 transitions, 681 flow [2025-02-08 08:35:38,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=681, PETRI_PLACES=143, PETRI_TRANSITIONS=90} [2025-02-08 08:35:38,503 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 65 predicate places. [2025-02-08 08:35:38,503 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 90 transitions, 681 flow [2025-02-08 08:35:38,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:38,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:38,503 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-02-08 08:35:38,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 08:35:38,503 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:38,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash -116607633, now seen corresponding path program 7 times [2025-02-08 08:35:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637971458] [2025-02-08 08:35:38,504 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:35:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:38,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:35:38,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:35:38,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:38,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:38,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:38,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637971458] [2025-02-08 08:35:38,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637971458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:38,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:38,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:38,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128940884] [2025-02-08 08:35:38,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:38,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:38,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:38,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:38,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:38,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:38,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 90 transitions, 681 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:38,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:38,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:38,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:39,350 INFO L124 PetriNetUnfolderBase]: 867/2125 cut-off events. [2025-02-08 08:35:39,351 INFO L125 PetriNetUnfolderBase]: For 3909/3909 co-relation queries the response was YES. [2025-02-08 08:35:39,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7186 conditions, 2125 events. 867/2125 cut-off events. For 3909/3909 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15695 event pairs, 185 based on Foata normal form. 4/2128 useless extension candidates. Maximal degree in co-relation 7150. Up to 888 conditions per place. [2025-02-08 08:35:39,361 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 114 selfloop transitions, 7 changer transitions 9/135 dead transitions. [2025-02-08 08:35:39,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 135 transitions, 1170 flow [2025-02-08 08:35:39,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:39,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 438 transitions. [2025-02-08 08:35:39,362 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.684375 [2025-02-08 08:35:39,363 INFO L175 Difference]: Start difference. First operand has 143 places, 90 transitions, 681 flow. Second operand 8 states and 438 transitions. [2025-02-08 08:35:39,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 135 transitions, 1170 flow [2025-02-08 08:35:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 135 transitions, 1096 flow, removed 19 selfloop flow, removed 12 redundant places. [2025-02-08 08:35:39,372 INFO L231 Difference]: Finished difference. Result has 134 places, 92 transitions, 689 flow [2025-02-08 08:35:39,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=689, PETRI_PLACES=134, PETRI_TRANSITIONS=92} [2025-02-08 08:35:39,372 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 56 predicate places. [2025-02-08 08:35:39,373 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 92 transitions, 689 flow [2025-02-08 08:35:39,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:39,373 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:39,373 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-02-08 08:35:39,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 08:35:39,373 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:39,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:39,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1983456221, now seen corresponding path program 8 times [2025-02-08 08:35:39,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:39,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435587786] [2025-02-08 08:35:39,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:39,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:39,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:39,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:39,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:35:39,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:39,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:39,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435587786] [2025-02-08 08:35:39,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435587786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:39,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785117187] [2025-02-08 08:35:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:39,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:39,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:39,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:39,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:39,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 92 transitions, 689 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:39,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:39,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:39,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:40,108 INFO L124 PetriNetUnfolderBase]: 847/2071 cut-off events. [2025-02-08 08:35:40,109 INFO L125 PetriNetUnfolderBase]: For 3069/3069 co-relation queries the response was YES. [2025-02-08 08:35:40,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6972 conditions, 2071 events. 847/2071 cut-off events. For 3069/3069 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15204 event pairs, 144 based on Foata normal form. 4/2074 useless extension candidates. Maximal degree in co-relation 6940. Up to 888 conditions per place. [2025-02-08 08:35:40,120 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 122 selfloop transitions, 8 changer transitions 6/141 dead transitions. [2025-02-08 08:35:40,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 141 transitions, 1177 flow [2025-02-08 08:35:40,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 442 transitions. [2025-02-08 08:35:40,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.690625 [2025-02-08 08:35:40,123 INFO L175 Difference]: Start difference. First operand has 134 places, 92 transitions, 689 flow. Second operand 8 states and 442 transitions. [2025-02-08 08:35:40,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 141 transitions, 1177 flow [2025-02-08 08:35:40,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 141 transitions, 1148 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-08 08:35:40,130 INFO L231 Difference]: Finished difference. Result has 139 places, 94 transitions, 717 flow [2025-02-08 08:35:40,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=139, PETRI_TRANSITIONS=94} [2025-02-08 08:35:40,131 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 61 predicate places. [2025-02-08 08:35:40,131 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 94 transitions, 717 flow [2025-02-08 08:35:40,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:40,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:40,131 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-02-08 08:35:40,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 08:35:40,132 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:40,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:40,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1362299143, now seen corresponding path program 9 times [2025-02-08 08:35:40,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75808953] [2025-02-08 08:35:40,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:35:40,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:40,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:40,144 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:40,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:35:40,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75808953] [2025-02-08 08:35:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75808953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:40,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322281667] [2025-02-08 08:35:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:40,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:40,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:40,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:40,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:40,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 94 transitions, 717 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:40,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:40,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:40,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:40,848 INFO L124 PetriNetUnfolderBase]: 839/2049 cut-off events. [2025-02-08 08:35:40,848 INFO L125 PetriNetUnfolderBase]: For 3481/3481 co-relation queries the response was YES. [2025-02-08 08:35:40,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6996 conditions, 2049 events. 839/2049 cut-off events. For 3481/3481 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15061 event pairs, 226 based on Foata normal form. 4/2052 useless extension candidates. Maximal degree in co-relation 6962. Up to 888 conditions per place. [2025-02-08 08:35:40,858 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 108 selfloop transitions, 5 changer transitions 21/139 dead transitions. [2025-02-08 08:35:40,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 1178 flow [2025-02-08 08:35:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:40,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 440 transitions. [2025-02-08 08:35:40,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-02-08 08:35:40,860 INFO L175 Difference]: Start difference. First operand has 139 places, 94 transitions, 717 flow. Second operand 8 states and 440 transitions. [2025-02-08 08:35:40,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 1178 flow [2025-02-08 08:35:40,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 139 transitions, 1156 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-08 08:35:40,868 INFO L231 Difference]: Finished difference. Result has 143 places, 91 transitions, 686 flow [2025-02-08 08:35:40,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=686, PETRI_PLACES=143, PETRI_TRANSITIONS=91} [2025-02-08 08:35:40,869 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 65 predicate places. [2025-02-08 08:35:40,869 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 91 transitions, 686 flow [2025-02-08 08:35:40,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:40,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:40,869 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-02-08 08:35:40,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 08:35:40,869 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:40,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:40,870 INFO L85 PathProgramCache]: Analyzing trace with hash 662495007, now seen corresponding path program 10 times [2025-02-08 08:35:40,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:40,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2634575] [2025-02-08 08:35:40,870 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:35:40,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:40,878 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:40,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 35 statements. [2025-02-08 08:35:40,881 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:35:40,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2634575] [2025-02-08 08:35:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2634575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:41,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:41,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561225820] [2025-02-08 08:35:41,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:41,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:41,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:41,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:41,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:41,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 91 transitions, 686 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:41,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:41,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:41,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:41,607 INFO L124 PetriNetUnfolderBase]: 671/1649 cut-off events. [2025-02-08 08:35:41,607 INFO L125 PetriNetUnfolderBase]: For 2847/2847 co-relation queries the response was YES. [2025-02-08 08:35:41,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5665 conditions, 1649 events. 671/1649 cut-off events. For 2847/2847 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11360 event pairs, 151 based on Foata normal form. 4/1648 useless extension candidates. Maximal degree in co-relation 5630. Up to 888 conditions per place. [2025-02-08 08:35:41,616 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 102 selfloop transitions, 6 changer transitions 12/125 dead transitions. [2025-02-08 08:35:41,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 125 transitions, 1075 flow [2025-02-08 08:35:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 432 transitions. [2025-02-08 08:35:41,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-02-08 08:35:41,620 INFO L175 Difference]: Start difference. First operand has 143 places, 91 transitions, 686 flow. Second operand 8 states and 432 transitions. [2025-02-08 08:35:41,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 125 transitions, 1075 flow [2025-02-08 08:35:41,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 125 transitions, 1033 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-02-08 08:35:41,628 INFO L231 Difference]: Finished difference. Result has 138 places, 91 transitions, 680 flow [2025-02-08 08:35:41,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=680, PETRI_PLACES=138, PETRI_TRANSITIONS=91} [2025-02-08 08:35:41,629 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2025-02-08 08:35:41,629 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 91 transitions, 680 flow [2025-02-08 08:35:41,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:41,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:41,629 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-02-08 08:35:41,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-08 08:35:41,630 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:41,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash -705578427, now seen corresponding path program 11 times [2025-02-08 08:35:41,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:41,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771603357] [2025-02-08 08:35:41,630 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:35:41,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:41,640 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:41,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:35:41,652 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:35:41,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:41,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:41,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:41,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771603357] [2025-02-08 08:35:41,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771603357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:41,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:41,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:41,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317310847] [2025-02-08 08:35:41,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:41,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:41,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:41,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:42,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:42,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 91 transitions, 680 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:42,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:42,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:42,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:42,313 INFO L124 PetriNetUnfolderBase]: 635/1527 cut-off events. [2025-02-08 08:35:42,313 INFO L125 PetriNetUnfolderBase]: For 2191/2191 co-relation queries the response was YES. [2025-02-08 08:35:42,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 1527 events. 635/1527 cut-off events. For 2191/2191 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10223 event pairs, 121 based on Foata normal form. 4/1530 useless extension candidates. Maximal degree in co-relation 5228. Up to 888 conditions per place. [2025-02-08 08:35:42,321 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 84 selfloop transitions, 2 changer transitions 31/122 dead transitions. [2025-02-08 08:35:42,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 122 transitions, 1039 flow [2025-02-08 08:35:42,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 428 transitions. [2025-02-08 08:35:42,322 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66875 [2025-02-08 08:35:42,322 INFO L175 Difference]: Start difference. First operand has 138 places, 91 transitions, 680 flow. Second operand 8 states and 428 transitions. [2025-02-08 08:35:42,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 122 transitions, 1039 flow [2025-02-08 08:35:42,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 122 transitions, 1014 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-02-08 08:35:42,328 INFO L231 Difference]: Finished difference. Result has 136 places, 85 transitions, 618 flow [2025-02-08 08:35:42,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=618, PETRI_PLACES=136, PETRI_TRANSITIONS=85} [2025-02-08 08:35:42,329 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 58 predicate places. [2025-02-08 08:35:42,329 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 85 transitions, 618 flow [2025-02-08 08:35:42,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:42,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:42,329 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-02-08 08:35:42,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 08:35:42,329 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:42,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash -508228599, now seen corresponding path program 12 times [2025-02-08 08:35:42,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:42,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370421810] [2025-02-08 08:35:42,330 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:35:42,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:42,337 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:42,344 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:42,344 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:35:42,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:42,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:42,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370421810] [2025-02-08 08:35:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370421810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:42,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:42,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585842124] [2025-02-08 08:35:42,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:42,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:42,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:42,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:42,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:42,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 85 transitions, 618 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:42,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:42,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:42,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:43,146 INFO L124 PetriNetUnfolderBase]: 467/1177 cut-off events. [2025-02-08 08:35:43,146 INFO L125 PetriNetUnfolderBase]: For 1283/1283 co-relation queries the response was YES. [2025-02-08 08:35:43,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 1177 events. 467/1177 cut-off events. For 1283/1283 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7501 event pairs, 100 based on Foata normal form. 4/1180 useless extension candidates. Maximal degree in co-relation 3870. Up to 612 conditions per place. [2025-02-08 08:35:43,152 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 90 selfloop transitions, 5 changer transitions 11/111 dead transitions. [2025-02-08 08:35:43,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 111 transitions, 944 flow [2025-02-08 08:35:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 423 transitions. [2025-02-08 08:35:43,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6609375 [2025-02-08 08:35:43,153 INFO L175 Difference]: Start difference. First operand has 136 places, 85 transitions, 618 flow. Second operand 8 states and 423 transitions. [2025-02-08 08:35:43,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 111 transitions, 944 flow [2025-02-08 08:35:43,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 111 transitions, 916 flow, removed 9 selfloop flow, removed 8 redundant places. [2025-02-08 08:35:43,157 INFO L231 Difference]: Finished difference. Result has 125 places, 85 transitions, 618 flow [2025-02-08 08:35:43,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=114, 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=8, PETRI_FLOW=618, PETRI_PLACES=125, PETRI_TRANSITIONS=85} [2025-02-08 08:35:43,158 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 47 predicate places. [2025-02-08 08:35:43,158 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 85 transitions, 618 flow [2025-02-08 08:35:43,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:43,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:43,158 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-02-08 08:35:43,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 08:35:43,159 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:43,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash 863411095, now seen corresponding path program 13 times [2025-02-08 08:35:43,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:43,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927270637] [2025-02-08 08:35:43,159 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:35:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:43,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:35:43,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:35:43,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:43,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:43,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927270637] [2025-02-08 08:35:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927270637] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435808160] [2025-02-08 08:35:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:43,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:43,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:43,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:43,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:43,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:43,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 85 transitions, 618 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:43,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:43,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:43,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:43,811 INFO L124 PetriNetUnfolderBase]: 623/1513 cut-off events. [2025-02-08 08:35:43,811 INFO L125 PetriNetUnfolderBase]: For 1639/1639 co-relation queries the response was YES. [2025-02-08 08:35:43,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4932 conditions, 1513 events. 623/1513 cut-off events. For 1639/1639 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10156 event pairs, 112 based on Foata normal form. 4/1516 useless extension candidates. Maximal degree in co-relation 4906. Up to 812 conditions per place. [2025-02-08 08:35:43,817 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 104 selfloop transitions, 7 changer transitions 6/122 dead transitions. [2025-02-08 08:35:43,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 1014 flow [2025-02-08 08:35:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 429 transitions. [2025-02-08 08:35:43,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6703125 [2025-02-08 08:35:43,821 INFO L175 Difference]: Start difference. First operand has 125 places, 85 transitions, 618 flow. Second operand 8 states and 429 transitions. [2025-02-08 08:35:43,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 1014 flow [2025-02-08 08:35:43,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 986 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-02-08 08:35:43,826 INFO L231 Difference]: Finished difference. Result has 127 places, 87 transitions, 641 flow [2025-02-08 08:35:43,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=641, PETRI_PLACES=127, PETRI_TRANSITIONS=87} [2025-02-08 08:35:43,827 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 49 predicate places. [2025-02-08 08:35:43,828 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 87 transitions, 641 flow [2025-02-08 08:35:43,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:43,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:43,829 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-02-08 08:35:43,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 08:35:43,829 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:43,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:43,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1872819295, now seen corresponding path program 14 times [2025-02-08 08:35:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:43,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803544163] [2025-02-08 08:35:43,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:43,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:43,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:43,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:35:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:44,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:44,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803544163] [2025-02-08 08:35:44,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803544163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:44,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:44,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:44,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525075072] [2025-02-08 08:35:44,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:44,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:44,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:44,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:44,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:44,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:44,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 87 transitions, 641 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:44,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:44,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:44,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:44,554 INFO L124 PetriNetUnfolderBase]: 623/1529 cut-off events. [2025-02-08 08:35:44,554 INFO L125 PetriNetUnfolderBase]: For 1843/1843 co-relation queries the response was YES. [2025-02-08 08:35:44,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5205 conditions, 1529 events. 623/1529 cut-off events. For 1843/1843 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10368 event pairs, 134 based on Foata normal form. 4/1532 useless extension candidates. Maximal degree in co-relation 5178. Up to 812 conditions per place. [2025-02-08 08:35:44,559 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 101 selfloop transitions, 6 changer transitions 10/122 dead transitions. [2025-02-08 08:35:44,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 122 transitions, 1030 flow [2025-02-08 08:35:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:44,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 431 transitions. [2025-02-08 08:35:44,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6734375 [2025-02-08 08:35:44,560 INFO L175 Difference]: Start difference. First operand has 127 places, 87 transitions, 641 flow. Second operand 8 states and 431 transitions. [2025-02-08 08:35:44,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 122 transitions, 1030 flow [2025-02-08 08:35:44,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 122 transitions, 1013 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-08 08:35:44,564 INFO L231 Difference]: Finished difference. Result has 134 places, 88 transitions, 661 flow [2025-02-08 08:35:44,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=661, PETRI_PLACES=134, PETRI_TRANSITIONS=88} [2025-02-08 08:35:44,565 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 56 predicate places. [2025-02-08 08:35:44,566 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 88 transitions, 661 flow [2025-02-08 08:35:44,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:44,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:44,566 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-02-08 08:35:44,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-08 08:35:44,566 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:44,567 INFO L85 PathProgramCache]: Analyzing trace with hash -259896809, now seen corresponding path program 15 times [2025-02-08 08:35:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075249418] [2025-02-08 08:35:44,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 08:35:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:44,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:44,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:44,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 08:35:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075249418] [2025-02-08 08:35:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075249418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:44,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218031865] [2025-02-08 08:35:44,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:44,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:44,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:44,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:44,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:44,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 88 transitions, 661 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:44,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:44,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:44,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:45,217 INFO L124 PetriNetUnfolderBase]: 607/1465 cut-off events. [2025-02-08 08:35:45,217 INFO L125 PetriNetUnfolderBase]: For 2445/2445 co-relation queries the response was YES. [2025-02-08 08:35:45,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 1465 events. 607/1465 cut-off events. For 2445/2445 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9856 event pairs, 112 based on Foata normal form. 4/1468 useless extension candidates. Maximal degree in co-relation 5190. Up to 812 conditions per place. [2025-02-08 08:35:45,223 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 84 selfloop transitions, 3 changer transitions 28/120 dead transitions. [2025-02-08 08:35:45,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 120 transitions, 1031 flow [2025-02-08 08:35:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:45,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 427 transitions. [2025-02-08 08:35:45,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6671875 [2025-02-08 08:35:45,224 INFO L175 Difference]: Start difference. First operand has 134 places, 88 transitions, 661 flow. Second operand 8 states and 427 transitions. [2025-02-08 08:35:45,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 120 transitions, 1031 flow [2025-02-08 08:35:45,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 120 transitions, 1012 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-02-08 08:35:45,229 INFO L231 Difference]: Finished difference. Result has 135 places, 83 transitions, 607 flow [2025-02-08 08:35:45,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=135, PETRI_TRANSITIONS=83} [2025-02-08 08:35:45,230 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 57 predicate places. [2025-02-08 08:35:45,230 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 83 transitions, 607 flow [2025-02-08 08:35:45,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:45,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:45,230 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-02-08 08:35:45,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-08 08:35:45,231 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:45,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1108397693, now seen corresponding path program 16 times [2025-02-08 08:35:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:45,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359324478] [2025-02-08 08:35:45,231 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 08:35:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:45,237 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:45,239 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 23 of 35 statements. [2025-02-08 08:35:45,239 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 08:35:45,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:45,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:45,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:45,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359324478] [2025-02-08 08:35:45,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359324478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:45,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:45,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:45,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987969699] [2025-02-08 08:35:45,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:45,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:45,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:45,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:45,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:45,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:45,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 83 transitions, 607 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:45,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:45,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:45,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:45,919 INFO L124 PetriNetUnfolderBase]: 407/1031 cut-off events. [2025-02-08 08:35:45,920 INFO L125 PetriNetUnfolderBase]: For 1353/1353 co-relation queries the response was YES. [2025-02-08 08:35:45,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3541 conditions, 1031 events. 407/1031 cut-off events. For 1353/1353 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6338 event pairs, 48 based on Foata normal form. 4/1030 useless extension candidates. Maximal degree in co-relation 3512. Up to 460 conditions per place. [2025-02-08 08:35:45,924 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 85 selfloop transitions, 5 changer transitions 9/104 dead transitions. [2025-02-08 08:35:45,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 104 transitions, 899 flow [2025-02-08 08:35:45,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:45,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 419 transitions. [2025-02-08 08:35:45,925 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6546875 [2025-02-08 08:35:45,926 INFO L175 Difference]: Start difference. First operand has 135 places, 83 transitions, 607 flow. Second operand 8 states and 419 transitions. [2025-02-08 08:35:45,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 104 transitions, 899 flow [2025-02-08 08:35:45,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 104 transitions, 861 flow, removed 11 selfloop flow, removed 9 redundant places. [2025-02-08 08:35:45,930 INFO L231 Difference]: Finished difference. Result has 127 places, 83 transitions, 603 flow [2025-02-08 08:35:45,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=603, PETRI_PLACES=127, PETRI_TRANSITIONS=83} [2025-02-08 08:35:45,931 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 49 predicate places. [2025-02-08 08:35:45,931 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 83 transitions, 603 flow [2025-02-08 08:35:45,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:45,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:45,931 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-02-08 08:35:45,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-08 08:35:45,931 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:45,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:45,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1214323883, now seen corresponding path program 17 times [2025-02-08 08:35:45,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:45,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226673300] [2025-02-08 08:35:45,932 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 08:35:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:45,940 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:45,954 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:35:45,954 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 08:35:45,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:46,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:46,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226673300] [2025-02-08 08:35:46,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226673300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:46,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:46,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:46,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448941211] [2025-02-08 08:35:46,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:46,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:46,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:46,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:46,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:46,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:46,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 83 transitions, 603 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:46,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:46,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:46,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:46,730 INFO L124 PetriNetUnfolderBase]: 383/987 cut-off events. [2025-02-08 08:35:46,730 INFO L125 PetriNetUnfolderBase]: For 1055/1059 co-relation queries the response was YES. [2025-02-08 08:35:46,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 987 events. 383/987 cut-off events. For 1055/1059 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6014 event pairs, 76 based on Foata normal form. 4/988 useless extension candidates. Maximal degree in co-relation 3342. Up to 492 conditions per place. [2025-02-08 08:35:46,734 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 86 selfloop transitions, 5 changer transitions 11/107 dead transitions. [2025-02-08 08:35:46,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 107 transitions, 915 flow [2025-02-08 08:35:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 420 transitions. [2025-02-08 08:35:46,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-02-08 08:35:46,734 INFO L175 Difference]: Start difference. First operand has 127 places, 83 transitions, 603 flow. Second operand 8 states and 420 transitions. [2025-02-08 08:35:46,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 107 transitions, 915 flow [2025-02-08 08:35:46,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 107 transitions, 895 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-08 08:35:46,737 INFO L231 Difference]: Finished difference. Result has 129 places, 83 transitions, 608 flow [2025-02-08 08:35:46,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=608, PETRI_PLACES=129, PETRI_TRANSITIONS=83} [2025-02-08 08:35:46,737 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 51 predicate places. [2025-02-08 08:35:46,738 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 83 transitions, 608 flow [2025-02-08 08:35:46,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:46,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:46,738 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-02-08 08:35:46,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-08 08:35:46,738 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 185359367, now seen corresponding path program 18 times [2025-02-08 08:35:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:46,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069809768] [2025-02-08 08:35:46,738 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 08:35:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:46,744 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:46,748 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:46,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-02-08 08:35:46,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:47,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:47,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069809768] [2025-02-08 08:35:47,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069809768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:47,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:47,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:47,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647172209] [2025-02-08 08:35:47,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:47,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:47,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:47,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:47,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:47,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:47,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 83 transitions, 608 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:47,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:47,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:47,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:47,389 INFO L124 PetriNetUnfolderBase]: 363/929 cut-off events. [2025-02-08 08:35:47,390 INFO L125 PetriNetUnfolderBase]: For 1153/1153 co-relation queries the response was YES. [2025-02-08 08:35:47,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 929 events. 363/929 cut-off events. For 1153/1153 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5527 event pairs, 41 based on Foata normal form. 4/932 useless extension candidates. Maximal degree in co-relation 3240. Up to 352 conditions per place. [2025-02-08 08:35:47,393 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 94 selfloop transitions, 6 changer transitions 8/113 dead transitions. [2025-02-08 08:35:47,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 113 transitions, 950 flow [2025-02-08 08:35:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:47,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 424 transitions. [2025-02-08 08:35:47,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-02-08 08:35:47,394 INFO L175 Difference]: Start difference. First operand has 129 places, 83 transitions, 608 flow. Second operand 8 states and 424 transitions. [2025-02-08 08:35:47,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 113 transitions, 950 flow [2025-02-08 08:35:47,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 113 transitions, 922 flow, removed 5 selfloop flow, removed 7 redundant places. [2025-02-08 08:35:47,397 INFO L231 Difference]: Finished difference. Result has 130 places, 84 transitions, 616 flow [2025-02-08 08:35:47,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=616, PETRI_PLACES=130, PETRI_TRANSITIONS=84} [2025-02-08 08:35:47,399 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 52 predicate places. [2025-02-08 08:35:47,399 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 84 transitions, 616 flow [2025-02-08 08:35:47,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:47,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:47,399 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-02-08 08:35:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-02-08 08:35:47,399 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:47,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:47,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2119104025, now seen corresponding path program 19 times [2025-02-08 08:35:47,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:47,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124187523] [2025-02-08 08:35:47,400 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 08:35:47,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:47,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 08:35:47,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 08:35:47,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:35:47,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124187523] [2025-02-08 08:35:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124187523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:47,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:47,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:47,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557126467] [2025-02-08 08:35:47,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:47,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:47,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:47,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:47,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:47,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:47,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 84 transitions, 616 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:47,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:47,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:47,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:48,015 INFO L124 PetriNetUnfolderBase]: 351/873 cut-off events. [2025-02-08 08:35:48,015 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2025-02-08 08:35:48,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3191 conditions, 873 events. 351/873 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5011 event pairs, 56 based on Foata normal form. 4/876 useless extension candidates. Maximal degree in co-relation 3164. Up to 340 conditions per place. [2025-02-08 08:35:48,018 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 80 selfloop transitions, 3 changer transitions 22/110 dead transitions. [2025-02-08 08:35:48,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 110 transitions, 936 flow [2025-02-08 08:35:48,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 421 transitions. [2025-02-08 08:35:48,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578125 [2025-02-08 08:35:48,019 INFO L175 Difference]: Start difference. First operand has 130 places, 84 transitions, 616 flow. Second operand 8 states and 421 transitions. [2025-02-08 08:35:48,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 110 transitions, 936 flow [2025-02-08 08:35:48,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 110 transitions, 918 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-08 08:35:48,022 INFO L231 Difference]: Finished difference. Result has 132 places, 81 transitions, 584 flow [2025-02-08 08:35:48,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=584, PETRI_PLACES=132, PETRI_TRANSITIONS=81} [2025-02-08 08:35:48,023 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 54 predicate places. [2025-02-08 08:35:48,023 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 81 transitions, 584 flow [2025-02-08 08:35:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:48,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 08:35:48,023 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-02-08 08:35:48,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-08 08:35:48,023 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2025-02-08 08:35:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:35:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2097623703, now seen corresponding path program 20 times [2025-02-08 08:35:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:35:48,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214238416] [2025-02-08 08:35:48,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 08:35:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:35:48,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 08:35:48,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 08:35:48,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 08:35:48,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:35:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 08:35:48,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:35:48,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214238416] [2025-02-08 08:35:48,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214238416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:35:48,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:35:48,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 08:35:48,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539979865] [2025-02-08 08:35:48,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:35:48,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 08:35:48,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:35:48,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 08:35:48,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 08:35:48,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 80 [2025-02-08 08:35:48,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 81 transitions, 584 flow. Second operand has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:48,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 08:35:48,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 80 [2025-02-08 08:35:48,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 08:35:48,616 INFO L124 PetriNetUnfolderBase]: 187/497 cut-off events. [2025-02-08 08:35:48,616 INFO L125 PetriNetUnfolderBase]: For 631/631 co-relation queries the response was YES. [2025-02-08 08:35:48,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 497 events. 187/497 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2341 event pairs, 18 based on Foata normal form. 4/500 useless extension candidates. Maximal degree in co-relation 1876. Up to 228 conditions per place. [2025-02-08 08:35:48,618 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 0 selfloop transitions, 0 changer transitions 94/94 dead transitions. [2025-02-08 08:35:48,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 94 transitions, 817 flow [2025-02-08 08:35:48,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:35:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-08 08:35:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 411 transitions. [2025-02-08 08:35:48,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6421875 [2025-02-08 08:35:48,619 INFO L175 Difference]: Start difference. First operand has 132 places, 81 transitions, 584 flow. Second operand 8 states and 411 transitions. [2025-02-08 08:35:48,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 94 transitions, 817 flow [2025-02-08 08:35:48,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 94 transitions, 794 flow, removed 5 selfloop flow, removed 9 redundant places. [2025-02-08 08:35:48,621 INFO L231 Difference]: Finished difference. Result has 123 places, 0 transitions, 0 flow [2025-02-08 08:35:48,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=123, PETRI_TRANSITIONS=0} [2025-02-08 08:35:48,621 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 45 predicate places. [2025-02-08 08:35:48,621 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 0 transitions, 0 flow [2025-02-08 08:35:48,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 49.75) internal successors, (398), 8 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 08:35:48,624 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 60 remaining) [2025-02-08 08:35:48,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 60 remaining) [2025-02-08 08:35:48,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (27 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (26 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 60 remaining) [2025-02-08 08:35:48,627 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 60 remaining) [2025-02-08 08:35:48,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-08 08:35:48,628 INFO L422 BasicCegarLoop]: Path program histogram: [20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:35:48,631 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 08:35:48,631 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 08:35:48,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 08:35:48 BasicIcfg [2025-02-08 08:35:48,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 08:35:48,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 08:35:48,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 08:35:48,636 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 08:35:48,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:35:12" (3/4) ... [2025-02-08 08:35:48,637 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 08:35:48,639 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 08:35:48,639 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 08:35:48,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 165 nodes and edges [2025-02-08 08:35:48,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 74 nodes and edges [2025-02-08 08:35:48,644 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-02-08 08:35:48,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 08:35:48,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 08:35:48,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 08:35:48,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 08:35:48,701 INFO L158 Benchmark]: Toolchain (without parser) took 37663.55ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 158.0MB in the beginning and 129.7MB in the end (delta: 28.2MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2025-02-08 08:35:48,702 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:35:48,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.30ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 145.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:35:48,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.05ms. Allocated memory is still 201.3MB. Free memory was 145.4MB in the beginning and 143.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:35:48,702 INFO L158 Benchmark]: Boogie Preprocessor took 36.56ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 140.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:35:48,702 INFO L158 Benchmark]: IcfgBuilder took 1117.38ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 53.9MB in the end (delta: 86.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-08 08:35:48,702 INFO L158 Benchmark]: TraceAbstraction took 36170.75ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 52.7MB in the beginning and 138.1MB in the end (delta: -85.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 08:35:48,703 INFO L158 Benchmark]: Witness Printer took 65.68ms. Allocated memory is still 243.3MB. Free memory was 138.1MB in the beginning and 129.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 08:35:48,703 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.30ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 145.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.05ms. Allocated memory is still 201.3MB. Free memory was 145.4MB in the beginning and 143.1MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.56ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 140.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1117.38ms. Allocated memory is still 201.3MB. Free memory was 140.4MB in the beginning and 53.9MB in the end (delta: 86.5MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * TraceAbstraction took 36170.75ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 52.7MB in the beginning and 138.1MB in the end (delta: -85.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 65.68ms. Allocated memory is still 243.3MB. Free memory was 138.1MB in the beginning and 129.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 66]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 123 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.1s, OverallIterations: 45, TraceHistogramMax: 2, PathProgramHistogramMax: 20, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9295 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7509 mSDsluCounter, 6483 SdHoareTripleChecker+Invalid, 11.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6173 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26073 IncrementalHoareTripleChecker+Invalid, 26221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 310 mSDtfsCounter, 26073 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 694 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 416 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=738occurred in iteration=30, InterpolantAutomatonStates: 312, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 1204 NumberOfCodeBlocks, 1068 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 1245 ConstructedInterpolants, 14 QuantifiedInterpolants, 12603 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2089 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 64 InterpolantComputations, 37 PerfectInterpolantSequences, 196/253 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 08:35:48,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE