./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/reorder_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/reorder_5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 00:55:30,289 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 00:55:30,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-09 00:55:30,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 00:55:30,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 00:55:30,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 00:55:30,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 00:55:30,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 00:55:30,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 00:55:30,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 00:55:30,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 00:55:30,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 00:55:30,368 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 00:55:30,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:30,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 00:55:30,370 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 00:55:30,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 00:55:30,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 00:55:30,371 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 00:55:30,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 00:55:30,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 00:55:30,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 00:55:30,371 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd [2025-03-09 00:55:30,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 00:55:30,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 00:55:30,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 00:55:30,615 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 00:55:30,615 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 00:55:30,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5.i [2025-03-09 00:55:31,714 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b0e33e3/30d8cfca9b8d416faf7326435c0dd8b6/FLAG059077189 [2025-03-09 00:55:32,001 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 00:55:32,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5.i [2025-03-09 00:55:32,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b0e33e3/30d8cfca9b8d416faf7326435c0dd8b6/FLAG059077189 [2025-03-09 00:55:32,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5b0e33e3/30d8cfca9b8d416faf7326435c0dd8b6 [2025-03-09 00:55:32,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 00:55:32,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 00:55:32,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:32,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 00:55:32,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 00:55:32,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425d401b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32, skipping insertion in model container [2025-03-09 00:55:32,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 00:55:32,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:32,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 00:55:32,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 00:55:32,555 INFO L204 MainTranslator]: Completed translation [2025-03-09 00:55:32,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32 WrapperNode [2025-03-09 00:55:32,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 00:55:32,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:32,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 00:55:32,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 00:55:32,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,586 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2025-03-09 00:55:32,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 00:55:32,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 00:55:32,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 00:55:32,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 00:55:32,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,607 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-09 00:55:32,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 00:55:32,616 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 00:55:32,616 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 00:55:32,616 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 00:55:32,617 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (1/1) ... [2025-03-09 00:55:32,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 00:55:32,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 00:55:32,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 00:55:32,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 00:55:32,660 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-09 00:55:32,661 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-09 00:55:32,661 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 00:55:32,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 00:55:32,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 00:55:32,662 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 00:55:32,778 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 00:55:32,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 00:55:32,990 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-03-09 00:55:32,991 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-03-09 00:55:32,991 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-03-09 00:55:32,991 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-03-09 00:55:32,992 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 00:55:32,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 00:55:33,103 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 00:55:33,105 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 00:55:33,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:33 BoogieIcfgContainer [2025-03-09 00:55:33,105 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 00:55:33,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 00:55:33,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 00:55:33,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 00:55:33,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 12:55:32" (1/3) ... [2025-03-09 00:55:33,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19964786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:33, skipping insertion in model container [2025-03-09 00:55:33,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 12:55:32" (2/3) ... [2025-03-09 00:55:33,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19964786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 12:55:33, skipping insertion in model container [2025-03-09 00:55:33,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 12:55:33" (3/3) ... [2025-03-09 00:55:33,113 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-03-09 00:55:33,123 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 00:55:33,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 48 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-09 00:55:33,124 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 00:55:33,158 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-09 00:55:33,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:33,229 INFO L124 PetriNetUnfolderBase]: 12/131 cut-off events. [2025-03-09 00:55:33,232 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-09 00:55:33,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 12/131 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 653 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2025-03-09 00:55:33,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:33,239 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 132 flow [2025-03-09 00:55:33,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:33,255 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;@3d5d5875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:33,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-09 00:55:33,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:33,259 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 00:55:33,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:55:33,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:33,260 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 00:55:33,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:33,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:33,265 INFO L85 PathProgramCache]: Analyzing trace with hash 9574334, now seen corresponding path program 1 times [2025-03-09 00:55:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878696567] [2025-03-09 00:55:33,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:33,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:55:33,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:55:33,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:33,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:33,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:33,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:33,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878696567] [2025-03-09 00:55:33,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878696567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:33,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:33,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:33,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823543816] [2025-03-09 00:55:33,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:55:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:33,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:55:33,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:55:33,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 56 [2025-03-09 00:55:33,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:33,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:33,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 56 [2025-03-09 00:55:33,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:33,565 INFO L124 PetriNetUnfolderBase]: 286/722 cut-off events. [2025-03-09 00:55:33,566 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-09 00:55:33,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 722 events. 286/722 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4301 event pairs, 263 based on Foata normal form. 38/653 useless extension candidates. Maximal degree in co-relation 994. Up to 528 conditions per place. [2025-03-09 00:55:33,574 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 28 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2025-03-09 00:55:33,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 180 flow [2025-03-09 00:55:33,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:55:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:55:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 80 transitions. [2025-03-09 00:55:33,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-09 00:55:33,586 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 132 flow. Second operand 2 states and 80 transitions. [2025-03-09 00:55:33,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 180 flow [2025-03-09 00:55:33,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:33,594 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 124 flow [2025-03-09 00:55:33,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2025-03-09 00:55:33,598 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 00:55:33,600 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 124 flow [2025-03-09 00:55:33,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:33,600 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:33,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:33,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 00:55:33,601 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:33,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:33,602 INFO L85 PathProgramCache]: Analyzing trace with hash 296841434, now seen corresponding path program 1 times [2025-03-09 00:55:33,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:33,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021905954] [2025-03-09 00:55:33,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:33,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:33,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:33,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:33,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021905954] [2025-03-09 00:55:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021905954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:33,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:33,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742365558] [2025-03-09 00:55:33,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:33,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:33,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:33,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:33,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-03-09 00:55:33,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:33,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:33,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-03-09 00:55:33,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:33,891 INFO L124 PetriNetUnfolderBase]: 327/786 cut-off events. [2025-03-09 00:55:33,891 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-09 00:55:33,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 786 events. 327/786 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4798 event pairs, 228 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1423. Up to 464 conditions per place. [2025-03-09 00:55:33,895 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 35 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2025-03-09 00:55:33,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 208 flow [2025-03-09 00:55:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:33,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:33,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-09 00:55:33,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-09 00:55:33,897 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 124 flow. Second operand 3 states and 99 transitions. [2025-03-09 00:55:33,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 208 flow [2025-03-09 00:55:33,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 208 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:33,898 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 124 flow [2025-03-09 00:55:33,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2025-03-09 00:55:33,899 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -1 predicate places. [2025-03-09 00:55:33,899 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 124 flow [2025-03-09 00:55:33,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:33,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:33,899 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:33,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 00:55:33,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:33,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:33,901 INFO L85 PathProgramCache]: Analyzing trace with hash 296841435, now seen corresponding path program 1 times [2025-03-09 00:55:33,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:33,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698975065] [2025-03-09 00:55:33,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:33,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:33,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:33,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:33,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:33,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:34,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698975065] [2025-03-09 00:55:34,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698975065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:34,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:34,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019261801] [2025-03-09 00:55:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:34,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:34,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:34,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:34,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 00:55:34,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:34,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:34,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 00:55:34,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:34,417 INFO L124 PetriNetUnfolderBase]: 638/1611 cut-off events. [2025-03-09 00:55:34,417 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2025-03-09 00:55:34,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 1611 events. 638/1611 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11861 event pairs, 444 based on Foata normal form. 1/1447 useless extension candidates. Maximal degree in co-relation 2910. Up to 603 conditions per place. [2025-03-09 00:55:34,424 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 57 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2025-03-09 00:55:34,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 81 transitions, 330 flow [2025-03-09 00:55:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-03-09 00:55:34,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6741071428571429 [2025-03-09 00:55:34,426 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 124 flow. Second operand 4 states and 151 transitions. [2025-03-09 00:55:34,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 81 transitions, 330 flow [2025-03-09 00:55:34,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 81 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:34,431 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 146 flow [2025-03-09 00:55:34,431 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-09 00:55:34,432 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2025-03-09 00:55:34,432 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 146 flow [2025-03-09 00:55:34,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:34,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:34,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:34,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 00:55:34,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:34,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1228811062, now seen corresponding path program 1 times [2025-03-09 00:55:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:34,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871374197] [2025-03-09 00:55:34,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:34,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:34,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:34,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:34,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:34,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:34,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:34,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871374197] [2025-03-09 00:55:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871374197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:34,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:34,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:34,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346879352] [2025-03-09 00:55:34,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:34,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:34,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:34,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:34,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:34,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 00:55:34,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:34,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:34,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 00:55:34,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:34,831 INFO L124 PetriNetUnfolderBase]: 796/1927 cut-off events. [2025-03-09 00:55:34,831 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-09 00:55:34,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1927 events. 796/1927 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14224 event pairs, 364 based on Foata normal form. 1/1632 useless extension candidates. Maximal degree in co-relation 3490. Up to 1438 conditions per place. [2025-03-09 00:55:34,839 INFO L140 encePairwiseOnDemand]: 48/56 looper letters, 44 selfloop transitions, 7 changer transitions 2/70 dead transitions. [2025-03-09 00:55:34,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 293 flow [2025-03-09 00:55:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2025-03-09 00:55:34,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5758928571428571 [2025-03-09 00:55:34,842 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 146 flow. Second operand 4 states and 129 transitions. [2025-03-09 00:55:34,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 293 flow [2025-03-09 00:55:34,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:34,844 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 184 flow [2025-03-09 00:55:34,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-03-09 00:55:34,846 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2025-03-09 00:55:34,846 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 184 flow [2025-03-09 00:55:34,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:34,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:34,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:34,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 00:55:34,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:34,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:34,847 INFO L85 PathProgramCache]: Analyzing trace with hash 561561307, now seen corresponding path program 1 times [2025-03-09 00:55:34,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:34,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450832451] [2025-03-09 00:55:34,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:34,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:34,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:34,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:34,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:34,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:34,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:34,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450832451] [2025-03-09 00:55:34,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450832451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:34,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:34,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132732463] [2025-03-09 00:55:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:34,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:34,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:34,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:34,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:34,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 56 [2025-03-09 00:55:34,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:34,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:34,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 56 [2025-03-09 00:55:34,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:35,023 INFO L124 PetriNetUnfolderBase]: 704/1698 cut-off events. [2025-03-09 00:55:35,023 INFO L125 PetriNetUnfolderBase]: For 211/214 co-relation queries the response was YES. [2025-03-09 00:55:35,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3297 conditions, 1698 events. 704/1698 cut-off events. For 211/214 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12470 event pairs, 514 based on Foata normal form. 0/1636 useless extension candidates. Maximal degree in co-relation 3287. Up to 1009 conditions per place. [2025-03-09 00:55:35,031 INFO L140 encePairwiseOnDemand]: 52/56 looper letters, 38 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-09 00:55:35,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 278 flow [2025-03-09 00:55:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2025-03-09 00:55:35,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-03-09 00:55:35,035 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 184 flow. Second operand 3 states and 99 transitions. [2025-03-09 00:55:35,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 278 flow [2025-03-09 00:55:35,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 267 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:35,037 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 177 flow [2025-03-09 00:55:35,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2025-03-09 00:55:35,038 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 4 predicate places. [2025-03-09 00:55:35,039 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 177 flow [2025-03-09 00:55:35,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,039 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:35,039 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:35,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 00:55:35,039 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:35,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash 561561308, now seen corresponding path program 1 times [2025-03-09 00:55:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568693479] [2025-03-09 00:55:35,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:35,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:35,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:35,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:35,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568693479] [2025-03-09 00:55:35,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568693479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:35,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:35,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078694560] [2025-03-09 00:55:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:35,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:35,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:35,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:35,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 56 [2025-03-09 00:55:35,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:35,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 56 [2025-03-09 00:55:35,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:35,426 INFO L124 PetriNetUnfolderBase]: 919/2071 cut-off events. [2025-03-09 00:55:35,426 INFO L125 PetriNetUnfolderBase]: For 303/321 co-relation queries the response was YES. [2025-03-09 00:55:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4183 conditions, 2071 events. 919/2071 cut-off events. For 303/321 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15109 event pairs, 172 based on Foata normal form. 0/1893 useless extension candidates. Maximal degree in co-relation 4173. Up to 654 conditions per place. [2025-03-09 00:55:35,434 INFO L140 encePairwiseOnDemand]: 43/56 looper letters, 57 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2025-03-09 00:55:35,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 411 flow [2025-03-09 00:55:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2025-03-09 00:55:35,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5928571428571429 [2025-03-09 00:55:35,435 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 177 flow. Second operand 5 states and 166 transitions. [2025-03-09 00:55:35,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 411 flow [2025-03-09 00:55:35,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 88 transitions, 401 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:35,439 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 266 flow [2025-03-09 00:55:35,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2025-03-09 00:55:35,440 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 9 predicate places. [2025-03-09 00:55:35,440 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 266 flow [2025-03-09 00:55:35,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:35,441 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:35,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 00:55:35,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:35,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:35,441 INFO L85 PathProgramCache]: Analyzing trace with hash 134642030, now seen corresponding path program 1 times [2025-03-09 00:55:35,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:35,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092762460] [2025-03-09 00:55:35,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:35,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:35,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:35,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:35,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092762460] [2025-03-09 00:55:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092762460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:35,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:35,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:35,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301550834] [2025-03-09 00:55:35,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:35,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:55:35,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:35,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:55:35,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:55:35,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 56 [2025-03-09 00:55:35,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:35,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 56 [2025-03-09 00:55:35,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:35,830 INFO L124 PetriNetUnfolderBase]: 357/971 cut-off events. [2025-03-09 00:55:35,830 INFO L125 PetriNetUnfolderBase]: For 437/439 co-relation queries the response was YES. [2025-03-09 00:55:35,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2288 conditions, 971 events. 357/971 cut-off events. For 437/439 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6366 event pairs, 327 based on Foata normal form. 8/976 useless extension candidates. Maximal degree in co-relation 2275. Up to 659 conditions per place. [2025-03-09 00:55:35,834 INFO L140 encePairwiseOnDemand]: 50/56 looper letters, 47 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-03-09 00:55:35,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 394 flow [2025-03-09 00:55:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:35,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2025-03-09 00:55:35,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5464285714285714 [2025-03-09 00:55:35,835 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 266 flow. Second operand 5 states and 153 transitions. [2025-03-09 00:55:35,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 394 flow [2025-03-09 00:55:35,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 389 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:35,838 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 274 flow [2025-03-09 00:55:35,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-09 00:55:35,839 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2025-03-09 00:55:35,839 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 274 flow [2025-03-09 00:55:35,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:35,839 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:35,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 00:55:35,839 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-03-09 00:55:35,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:35,839 INFO L85 PathProgramCache]: Analyzing trace with hash -121064097, now seen corresponding path program 1 times [2025-03-09 00:55:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:35,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222571536] [2025-03-09 00:55:35,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:35,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:35,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:55:35,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:55:35,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:35,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 00:55:35,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 00:55:35,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 00:55:35,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 00:55:35,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 00:55:35,877 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 00:55:35,880 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-09 00:55:35,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-03-09 00:55:35,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2025-03-09 00:55:35,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (11 of 15 remaining) [2025-03-09 00:55:35,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-03-09 00:55:35,881 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2025-03-09 00:55:35,882 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-03-09 00:55:35,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 00:55:35,882 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:35,884 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 00:55:35,884 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 00:55:35,902 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-09 00:55:35,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions, 192 flow [2025-03-09 00:55:35,923 INFO L124 PetriNetUnfolderBase]: 65/432 cut-off events. [2025-03-09 00:55:35,924 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-03-09 00:55:35,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 432 events. 65/432 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2657 event pairs, 1 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 267. Up to 32 conditions per place. [2025-03-09 00:55:35,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 74 transitions, 192 flow [2025-03-09 00:55:35,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 74 transitions, 192 flow [2025-03-09 00:55:35,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 00:55:35,927 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;@3d5d5875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 00:55:35,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-09 00:55:35,928 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 00:55:35,928 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-03-09 00:55:35,928 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 00:55:35,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:35,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 00:55:35,928 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:35,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash 11790782, now seen corresponding path program 1 times [2025-03-09 00:55:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:35,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824949650] [2025-03-09 00:55:35,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:35,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 00:55:35,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 00:55:35,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:35,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:35,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:35,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824949650] [2025-03-09 00:55:35,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824949650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:35,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:35,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 00:55:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604193393] [2025-03-09 00:55:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:35,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 00:55:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:35,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 00:55:35,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 00:55:35,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 74 [2025-03-09 00:55:35,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 192 flow. Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:35,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:35,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 74 [2025-03-09 00:55:35,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:37,463 INFO L124 PetriNetUnfolderBase]: 17090/28499 cut-off events. [2025-03-09 00:55:37,465 INFO L125 PetriNetUnfolderBase]: For 3309/3309 co-relation queries the response was YES. [2025-03-09 00:55:37,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53882 conditions, 28499 events. 17090/28499 cut-off events. For 3309/3309 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 228477 event pairs, 16038 based on Foata normal form. 2174/28451 useless extension candidates. Maximal degree in co-relation 32875. Up to 23687 conditions per place. [2025-03-09 00:55:37,620 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 41 selfloop transitions, 0 changer transitions 0/69 dead transitions. [2025-03-09 00:55:37,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 264 flow [2025-03-09 00:55:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 00:55:37,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-09 00:55:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2025-03-09 00:55:37,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6891891891891891 [2025-03-09 00:55:37,622 INFO L175 Difference]: Start difference. First operand has 71 places, 74 transitions, 192 flow. Second operand 2 states and 102 transitions. [2025-03-09 00:55:37,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 264 flow [2025-03-09 00:55:37,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:37,632 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 182 flow [2025-03-09 00:55:37,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2025-03-09 00:55:37,633 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -1 predicate places. [2025-03-09 00:55:37,633 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 182 flow [2025-03-09 00:55:37,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:37,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:37,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:37,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 00:55:37,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:37,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash 365551394, now seen corresponding path program 1 times [2025-03-09 00:55:37,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:37,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214056445] [2025-03-09 00:55:37,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:37,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:37,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:37,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:37,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:37,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:37,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214056445] [2025-03-09 00:55:37,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214056445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:37,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:37,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:37,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650341871] [2025-03-09 00:55:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:37,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:37,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:37,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:37,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:37,736 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 74 [2025-03-09 00:55:37,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:37,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:37,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 74 [2025-03-09 00:55:37,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:39,047 INFO L124 PetriNetUnfolderBase]: 19397/31545 cut-off events. [2025-03-09 00:55:39,047 INFO L125 PetriNetUnfolderBase]: For 3073/3104 co-relation queries the response was YES. [2025-03-09 00:55:39,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60157 conditions, 31545 events. 19397/31545 cut-off events. For 3073/3104 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 252511 event pairs, 13785 based on Foata normal form. 0/29900 useless extension candidates. Maximal degree in co-relation 60150. Up to 20551 conditions per place. [2025-03-09 00:55:39,216 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 55 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2025-03-09 00:55:39,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 320 flow [2025-03-09 00:55:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-03-09 00:55:39,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5900900900900901 [2025-03-09 00:55:39,220 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 182 flow. Second operand 3 states and 131 transitions. [2025-03-09 00:55:39,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 320 flow [2025-03-09 00:55:39,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 81 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 00:55:39,225 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 182 flow [2025-03-09 00:55:39,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2025-03-09 00:55:39,227 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, -1 predicate places. [2025-03-09 00:55:39,227 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 182 flow [2025-03-09 00:55:39,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:39,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:39,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 00:55:39,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 00:55:39,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:39,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash 365551395, now seen corresponding path program 1 times [2025-03-09 00:55:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526636118] [2025-03-09 00:55:39,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:39,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 00:55:39,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 00:55:39,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:39,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526636118] [2025-03-09 00:55:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526636118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:39,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016973912] [2025-03-09 00:55:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:39,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:39,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:39,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:39,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-03-09 00:55:39,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:39,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:39,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-03-09 00:55:39,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:42,196 INFO L124 PetriNetUnfolderBase]: 38653/63672 cut-off events. [2025-03-09 00:55:42,197 INFO L125 PetriNetUnfolderBase]: For 8131/8131 co-relation queries the response was YES. [2025-03-09 00:55:42,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122440 conditions, 63672 events. 38653/63672 cut-off events. For 8131/8131 co-relation queries the response was YES. Maximal size of possible extension queue 2391. Compared 563097 event pairs, 31970 based on Foata normal form. 1/60804 useless extension candidates. Maximal degree in co-relation 122432. Up to 26914 conditions per place. [2025-03-09 00:55:42,510 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 84 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2025-03-09 00:55:42,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 112 transitions, 492 flow [2025-03-09 00:55:42,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:42,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-03-09 00:55:42,511 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6554054054054054 [2025-03-09 00:55:42,511 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 182 flow. Second operand 4 states and 194 transitions. [2025-03-09 00:55:42,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 112 transitions, 492 flow [2025-03-09 00:55:42,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:42,598 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 204 flow [2025-03-09 00:55:42,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-03-09 00:55:42,599 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2025-03-09 00:55:42,599 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 204 flow [2025-03-09 00:55:42,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:42,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:42,599 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:42,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 00:55:42,599 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:42,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1305245898, now seen corresponding path program 1 times [2025-03-09 00:55:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:42,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476867365] [2025-03-09 00:55:42,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:42,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:42,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 00:55:42,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 00:55:42,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:42,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:42,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:42,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476867365] [2025-03-09 00:55:42,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476867365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:42,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:42,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 00:55:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593470276] [2025-03-09 00:55:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:42,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:55:42,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:42,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:55:42,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:55:42,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2025-03-09 00:55:42,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:42,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:42,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2025-03-09 00:55:42,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:46,117 INFO L124 PetriNetUnfolderBase]: 47827/77418 cut-off events. [2025-03-09 00:55:46,118 INFO L125 PetriNetUnfolderBase]: For 6509/6511 co-relation queries the response was YES. [2025-03-09 00:55:46,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147336 conditions, 77418 events. 47827/77418 cut-off events. For 6509/6511 co-relation queries the response was YES. Maximal size of possible extension queue 2777. Compared 682102 event pairs, 45564 based on Foata normal form. 1/70575 useless extension candidates. Maximal degree in co-relation 147326. Up to 66388 conditions per place. [2025-03-09 00:55:46,533 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 58 selfloop transitions, 7 changer transitions 2/88 dead transitions. [2025-03-09 00:55:46,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 88 transitions, 383 flow [2025-03-09 00:55:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:55:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:55:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2025-03-09 00:55:46,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622 [2025-03-09 00:55:46,535 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 204 flow. Second operand 4 states and 159 transitions. [2025-03-09 00:55:46,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 88 transitions, 383 flow [2025-03-09 00:55:46,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 88 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:46,545 INFO L231 Difference]: Finished difference. Result has 77 places, 73 transitions, 248 flow [2025-03-09 00:55:46,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2025-03-09 00:55:46,546 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 6 predicate places. [2025-03-09 00:55:46,546 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 248 flow [2025-03-09 00:55:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:46,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:46,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:46,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 00:55:46,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:46,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1807915811, now seen corresponding path program 1 times [2025-03-09 00:55:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194698336] [2025-03-09 00:55:46,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:46,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:46,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:46,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:46,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:46,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:46,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194698336] [2025-03-09 00:55:46,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194698336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:46,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:46,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:55:46,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372339652] [2025-03-09 00:55:46,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:46,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 00:55:46,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:46,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 00:55:46,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 00:55:46,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 74 [2025-03-09 00:55:46,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:46,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:46,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 74 [2025-03-09 00:55:46,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:49,775 INFO L124 PetriNetUnfolderBase]: 42077/69085 cut-off events. [2025-03-09 00:55:49,775 INFO L125 PetriNetUnfolderBase]: For 8741/8856 co-relation queries the response was YES. [2025-03-09 00:55:49,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135515 conditions, 69085 events. 42077/69085 cut-off events. For 8741/8856 co-relation queries the response was YES. Maximal size of possible extension queue 2573. Compared 619134 event pairs, 30936 based on Foata normal form. 0/67227 useless extension candidates. Maximal degree in co-relation 135503. Up to 45526 conditions per place. [2025-03-09 00:55:50,153 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 59 selfloop transitions, 4 changer transitions 0/85 dead transitions. [2025-03-09 00:55:50,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 85 transitions, 398 flow [2025-03-09 00:55:50,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 00:55:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 00:55:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2025-03-09 00:55:50,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5900900900900901 [2025-03-09 00:55:50,155 INFO L175 Difference]: Start difference. First operand has 77 places, 73 transitions, 248 flow. Second operand 3 states and 131 transitions. [2025-03-09 00:55:50,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 85 transitions, 398 flow [2025-03-09 00:55:50,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 85 transitions, 390 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-09 00:55:50,173 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 244 flow [2025-03-09 00:55:50,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2025-03-09 00:55:50,174 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2025-03-09 00:55:50,174 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 244 flow [2025-03-09 00:55:50,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:50,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:50,174 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:50,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 00:55:50,174 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:50,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1807915812, now seen corresponding path program 1 times [2025-03-09 00:55:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:50,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114846489] [2025-03-09 00:55:50,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:50,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:50,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:50,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:50,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:50,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:50,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:50,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114846489] [2025-03-09 00:55:50,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114846489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:50,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:50,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:50,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632160724] [2025-03-09 00:55:50,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:50,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:55:50,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:50,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:55:50,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:55:50,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2025-03-09 00:55:50,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:50,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:50,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2025-03-09 00:55:50,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:55:55,422 INFO L124 PetriNetUnfolderBase]: 61010/96021 cut-off events. [2025-03-09 00:55:55,422 INFO L125 PetriNetUnfolderBase]: For 14748/15221 co-relation queries the response was YES. [2025-03-09 00:55:55,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193892 conditions, 96021 events. 61010/96021 cut-off events. For 14748/15221 co-relation queries the response was YES. Maximal size of possible extension queue 3217. Compared 847922 event pairs, 22104 based on Foata normal form. 0/90623 useless extension candidates. Maximal degree in co-relation 193880. Up to 39978 conditions per place. [2025-03-09 00:55:55,933 INFO L140 encePairwiseOnDemand]: 61/74 looper letters, 97 selfloop transitions, 16 changer transitions 0/132 dead transitions. [2025-03-09 00:55:55,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 132 transitions, 624 flow [2025-03-09 00:55:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:55:55,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:55:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-03-09 00:55:55,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6108108108108108 [2025-03-09 00:55:55,934 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 244 flow. Second operand 5 states and 226 transitions. [2025-03-09 00:55:55,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 132 transitions, 624 flow [2025-03-09 00:55:56,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 132 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 00:55:56,312 INFO L231 Difference]: Finished difference. Result has 81 places, 80 transitions, 339 flow [2025-03-09 00:55:56,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=81, PETRI_TRANSITIONS=80} [2025-03-09 00:55:56,313 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places. [2025-03-09 00:55:56,313 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 80 transitions, 339 flow [2025-03-09 00:55:56,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:55:56,313 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:55:56,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 00:55:56,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:55:56,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:55:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1381383817, now seen corresponding path program 1 times [2025-03-09 00:55:56,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:55:56,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962101543] [2025-03-09 00:55:56,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:55:56,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:55:56,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 00:55:56,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 00:55:56,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:55:56,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:55:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:55:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:55:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962101543] [2025-03-09 00:55:56,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962101543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:55:56,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:55:56,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:55:56,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529401932] [2025-03-09 00:55:56,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:55:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 00:55:56,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:55:56,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 00:55:56,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-09 00:55:56,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-03-09 00:55:56,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 80 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:55:56,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:55:56,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-03-09 00:55:56,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:00,945 INFO L124 PetriNetUnfolderBase]: 42837/73021 cut-off events. [2025-03-09 00:56:00,946 INFO L125 PetriNetUnfolderBase]: For 26075/26077 co-relation queries the response was YES. [2025-03-09 00:56:01,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163892 conditions, 73021 events. 42837/73021 cut-off events. For 26075/26077 co-relation queries the response was YES. Maximal size of possible extension queue 2663. Compared 688249 event pairs, 31030 based on Foata normal form. 8/72706 useless extension candidates. Maximal degree in co-relation 163877. Up to 31080 conditions per place. [2025-03-09 00:56:01,379 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 109 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-09 00:56:01,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 137 transitions, 793 flow [2025-03-09 00:56:01,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 00:56:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 00:56:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 227 transitions. [2025-03-09 00:56:01,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6135135135135135 [2025-03-09 00:56:01,380 INFO L175 Difference]: Start difference. First operand has 81 places, 80 transitions, 339 flow. Second operand 5 states and 227 transitions. [2025-03-09 00:56:01,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 137 transitions, 793 flow [2025-03-09 00:56:01,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 137 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 00:56:01,401 INFO L231 Difference]: Finished difference. Result has 85 places, 81 transitions, 358 flow [2025-03-09 00:56:01,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=85, PETRI_TRANSITIONS=81} [2025-03-09 00:56:01,402 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 14 predicate places. [2025-03-09 00:56:01,402 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 81 transitions, 358 flow [2025-03-09 00:56:01,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:01,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:01,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:01,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 00:56:01,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:56:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2054670704, now seen corresponding path program 1 times [2025-03-09 00:56:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471086318] [2025-03-09 00:56:01,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:01,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:01,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 00:56:01,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 00:56:01,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:01,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:01,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471086318] [2025-03-09 00:56:01,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471086318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:01,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:01,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 00:56:01,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650230310] [2025-03-09 00:56:01,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:01,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 00:56:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:01,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 00:56:01,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 00:56:01,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 74 [2025-03-09 00:56:01,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 81 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:01,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:01,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 74 [2025-03-09 00:56:01,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:05,218 INFO L124 PetriNetUnfolderBase]: 37497/66420 cut-off events. [2025-03-09 00:56:05,218 INFO L125 PetriNetUnfolderBase]: For 24191/24199 co-relation queries the response was YES. [2025-03-09 00:56:05,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148563 conditions, 66420 events. 37497/66420 cut-off events. For 24191/24199 co-relation queries the response was YES. Maximal size of possible extension queue 2411. Compared 646304 event pairs, 26146 based on Foata normal form. 0/64587 useless extension candidates. Maximal degree in co-relation 148547. Up to 38316 conditions per place. [2025-03-09 00:56:05,599 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 64 selfloop transitions, 5 changer transitions 1/94 dead transitions. [2025-03-09 00:56:05,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 94 transitions, 524 flow [2025-03-09 00:56:05,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 00:56:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 00:56:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-03-09 00:56:05,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2025-03-09 00:56:05,601 INFO L175 Difference]: Start difference. First operand has 85 places, 81 transitions, 358 flow. Second operand 4 states and 164 transitions. [2025-03-09 00:56:05,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 94 transitions, 524 flow [2025-03-09 00:56:05,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 94 transitions, 512 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 00:56:05,623 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 348 flow [2025-03-09 00:56:05,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2025-03-09 00:56:05,623 INFO L279 CegarLoopForPetriNet]: 71 programPoint places, 13 predicate places. [2025-03-09 00:56:05,623 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 348 flow [2025-03-09 00:56:05,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:05,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 00:56:05,624 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 00:56:05,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 00:56:05,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr10ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr9ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-03-09 00:56:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 00:56:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 781561008, now seen corresponding path program 1 times [2025-03-09 00:56:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 00:56:05,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581454632] [2025-03-09 00:56:05,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 00:56:05,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 00:56:05,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 00:56:05,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 00:56:05,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 00:56:05,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 00:56:05,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 00:56:05,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 00:56:05,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581454632] [2025-03-09 00:56:05,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581454632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 00:56:05,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 00:56:05,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 00:56:05,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613306129] [2025-03-09 00:56:05,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 00:56:05,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 00:56:05,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 00:56:05,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 00:56:05,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 00:56:05,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 74 [2025-03-09 00:56:05,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 00:56:05,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 00:56:05,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 74 [2025-03-09 00:56:05,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 00:56:10,309 INFO L124 PetriNetUnfolderBase]: 51337/80322 cut-off events. [2025-03-09 00:56:10,309 INFO L125 PetriNetUnfolderBase]: For 26410/26423 co-relation queries the response was YES.