./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/reorder_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/reorder_2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:37:16,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:37:16,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-10 00:37:16,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:37:16,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:37:16,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:37:16,907 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:37:16,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:37:16,908 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:37:16,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:37:16,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:37:16,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:37:16,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:37:16,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:37:16,909 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:37:16,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:37:16,910 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:37:16,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:37:16,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:37:16,911 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:37:16,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:37:16,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:16,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:16,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:16,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:16,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:37:16,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:37:16,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:37:16,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:37:16,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:16,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:37:16,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:37:16,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:37:16,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:37:16,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:37:16,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:37:16,914 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:37:16,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:37:16,914 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eaeb1d72262bd1e189945b98598b3acb68c08676109949c39074605b8c62cb69 [2025-01-10 00:37:17,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:37:17,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:37:17,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:37:17,197 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:37:17,197 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:37:17,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_2.i [2025-01-10 00:37:18,463 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de7c5b6a4/cbad1dca23cd461999e56760f2616e7b/FLAGd3b77086d [2025-01-10 00:37:18,769 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:37:18,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/reorder_2.i [2025-01-10 00:37:18,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de7c5b6a4/cbad1dca23cd461999e56760f2616e7b/FLAGd3b77086d [2025-01-10 00:37:18,797 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/de7c5b6a4/cbad1dca23cd461999e56760f2616e7b [2025-01-10 00:37:18,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:37:18,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:37:18,802 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:18,802 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:37:18,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:37:18,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:18" (1/1) ... [2025-01-10 00:37:18,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaf004b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:18, skipping insertion in model container [2025-01-10 00:37:18,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:37:18" (1/1) ... [2025-01-10 00:37:18,851 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:37:19,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:19,221 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:37:19,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:37:19,367 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:37:19,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19 WrapperNode [2025-01-10 00:37:19,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:37:19,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:19,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:37:19,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:37:19,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,411 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 127 [2025-01-10 00:37:19,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:37:19,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:37:19,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:37:19,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:37:19,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,434 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-01-10 00:37:19,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:37:19,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:37:19,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:37:19,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:37:19,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (1/1) ... [2025-01-10 00:37:19,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:37:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:37:19,489 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 00:37:19,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-01-10 00:37:19,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:37:19,508 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-01-10 00:37:19,509 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-01-10 00:37:19,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:37:19,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:37:19,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:37:19,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:37:19,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:37:19,510 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 00:37:19,636 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:37:19,638 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:37:19,917 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:37:19,917 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:37:20,063 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:37:20,065 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 00:37:20,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:20 BoogieIcfgContainer [2025-01-10 00:37:20,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:37:20,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:37:20,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:37:20,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:37:20,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:37:18" (1/3) ... [2025-01-10 00:37:20,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dd22c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:20, skipping insertion in model container [2025-01-10 00:37:20,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:37:19" (2/3) ... [2025-01-10 00:37:20,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10dd22c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:37:20, skipping insertion in model container [2025-01-10 00:37:20,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:37:20" (3/3) ... [2025-01-10 00:37:20,075 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-01-10 00:37:20,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:37:20,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 50 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 00:37:20,090 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:37:20,147 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:37:20,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 59 transitions, 138 flow [2025-01-10 00:37:20,246 INFO L124 PetriNetUnfolderBase]: 14/137 cut-off events. [2025-01-10 00:37:20,250 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:37:20,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 14/137 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 668 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 69. Up to 7 conditions per place. [2025-01-10 00:37:20,256 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 59 transitions, 138 flow [2025-01-10 00:37:20,260 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 59 transitions, 138 flow [2025-01-10 00:37:20,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:20,283 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;@2f356e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:20,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 00:37:20,289 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:20,290 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:37:20,291 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:37:20,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:20,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:37:20,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 11159482, now seen corresponding path program 1 times [2025-01-10 00:37:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025817564] [2025-01-10 00:37:20,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:20,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:20,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:37:20,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:37:20,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:20,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:20,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:20,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025817564] [2025-01-10 00:37:20,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025817564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:20,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:20,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:37:20,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917396610] [2025-01-10 00:37:20,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:20,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:37:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:20,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:37:20,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:37:20,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 59 [2025-01-10 00:37:20,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 138 flow. Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:20,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:20,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 59 [2025-01-10 00:37:20,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:20,629 INFO L124 PetriNetUnfolderBase]: 86/377 cut-off events. [2025-01-10 00:37:20,630 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-10 00:37:20,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 377 events. 86/377 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2599 event pairs, 71 based on Foata normal form. 44/295 useless extension candidates. Maximal degree in co-relation 375. Up to 190 conditions per place. [2025-01-10 00:37:20,638 INFO L140 encePairwiseOnDemand]: 54/59 looper letters, 24 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2025-01-10 00:37:20,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 53 transitions, 174 flow [2025-01-10 00:37:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:37:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:37:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2025-01-10 00:37:20,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7372881355932204 [2025-01-10 00:37:20,650 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 138 flow. Second operand 2 states and 87 transitions. [2025-01-10 00:37:20,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 53 transitions, 174 flow [2025-01-10 00:37:20,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:20,656 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 126 flow [2025-01-10 00:37:20,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=126, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2025-01-10 00:37:20,661 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-01-10 00:37:20,661 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 126 flow [2025-01-10 00:37:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:20,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:20,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:20,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:37:20,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:20,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 345941239, now seen corresponding path program 1 times [2025-01-10 00:37:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685913612] [2025-01-10 00:37:20,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:20,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:20,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:20,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:20,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:20,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:20,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:20,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:20,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685913612] [2025-01-10 00:37:20,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685913612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:20,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:20,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:20,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781086977] [2025-01-10 00:37:20,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:20,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:20,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:20,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:20,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:20,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-01-10 00:37:20,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 126 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-01-10 00:37:20,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:20,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-01-10 00:37:20,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:21,040 INFO L124 PetriNetUnfolderBase]: 97/370 cut-off events. [2025-01-10 00:37:21,040 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-10 00:37:21,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 370 events. 97/370 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2506 event pairs, 65 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 607. Up to 168 conditions per place. [2025-01-10 00:37:21,046 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2025-01-10 00:37:21,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 186 flow [2025-01-10 00:37:21,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-01-10 00:37:21,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5988700564971752 [2025-01-10 00:37:21,052 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 126 flow. Second operand 3 states and 106 transitions. [2025-01-10 00:37:21,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 186 flow [2025-01-10 00:37:21,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:21,056 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 126 flow [2025-01-10 00:37:21,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-01-10 00:37:21,058 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-01-10 00:37:21,058 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 126 flow [2025-01-10 00:37:21,058 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-01-10 00:37:21,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:21,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:21,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:37:21,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:21,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:21,060 INFO L85 PathProgramCache]: Analyzing trace with hash 345941240, now seen corresponding path program 1 times [2025-01-10 00:37:21,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:21,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92134234] [2025-01-10 00:37:21,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:21,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:21,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:21,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92134234] [2025-01-10 00:37:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92134234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:21,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:21,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:21,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639678821] [2025-01-10 00:37:21,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:21,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:21,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:21,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:21,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:21,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-01-10 00:37:21,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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-01-10 00:37:21,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:21,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-01-10 00:37:21,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:21,641 INFO L124 PetriNetUnfolderBase]: 184/699 cut-off events. [2025-01-10 00:37:21,641 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-01-10 00:37:21,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1180 conditions, 699 events. 184/699 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5582 event pairs, 124 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 1174. Up to 215 conditions per place. [2025-01-10 00:37:21,647 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 47 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2025-01-10 00:37:21,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 300 flow [2025-01-10 00:37:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2025-01-10 00:37:21,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6822033898305084 [2025-01-10 00:37:21,651 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 126 flow. Second operand 4 states and 161 transitions. [2025-01-10 00:37:21,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 300 flow [2025-01-10 00:37:21,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:21,657 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 148 flow [2025-01-10 00:37:21,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-01-10 00:37:21,658 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 1 predicate places. [2025-01-10 00:37:21,659 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 148 flow [2025-01-10 00:37:21,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 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-01-10 00:37:21,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:21,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:21,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:37:21,660 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:21,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1895069489, now seen corresponding path program 1 times [2025-01-10 00:37:21,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:21,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454130719] [2025-01-10 00:37:21,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:21,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:21,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:21,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:21,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:21,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:21,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:21,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454130719] [2025-01-10 00:37:21,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454130719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:21,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:21,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:21,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663973873] [2025-01-10 00:37:21,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:21,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:21,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:21,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:21,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 00:37:21,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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-01-10 00:37:21,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:21,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 00:37:21,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:22,066 INFO L124 PetriNetUnfolderBase]: 226/748 cut-off events. [2025-01-10 00:37:22,066 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-10 00:37:22,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 748 events. 226/748 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6052 event pairs, 182 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 1317. Up to 488 conditions per place. [2025-01-10 00:37:22,071 INFO L140 encePairwiseOnDemand]: 51/59 looper letters, 36 selfloop transitions, 7 changer transitions 2/67 dead transitions. [2025-01-10 00:37:22,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 271 flow [2025-01-10 00:37:22,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-01-10 00:37:22,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.597457627118644 [2025-01-10 00:37:22,072 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 148 flow. Second operand 4 states and 141 transitions. [2025-01-10 00:37:22,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 271 flow [2025-01-10 00:37:22,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 269 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:22,075 INFO L231 Difference]: Finished difference. Result has 61 places, 56 transitions, 186 flow [2025-01-10 00:37:22,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=146, 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=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=61, PETRI_TRANSITIONS=56} [2025-01-10 00:37:22,076 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-01-10 00:37:22,076 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 56 transitions, 186 flow [2025-01-10 00:37:22,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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-01-10 00:37:22,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:22,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:22,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:37:22,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:22,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1382386628, now seen corresponding path program 1 times [2025-01-10 00:37:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:22,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523930711] [2025-01-10 00:37:22,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:22,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:22,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:22,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:22,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:22,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:22,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523930711] [2025-01-10 00:37:22,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523930711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:22,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:22,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:22,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880758303] [2025-01-10 00:37:22,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:22,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:22,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:22,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:22,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:22,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 59 [2025-01-10 00:37:22,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 56 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-01-10 00:37:22,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:22,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 59 [2025-01-10 00:37:22,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:22,256 INFO L124 PetriNetUnfolderBase]: 200/675 cut-off events. [2025-01-10 00:37:22,257 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-01-10 00:37:22,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 675 events. 200/675 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5287 event pairs, 136 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 1292. Up to 349 conditions per place. [2025-01-10 00:37:22,261 INFO L140 encePairwiseOnDemand]: 55/59 looper letters, 30 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-01-10 00:37:22,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 57 transitions, 256 flow [2025-01-10 00:37:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2025-01-10 00:37:22,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5988700564971752 [2025-01-10 00:37:22,265 INFO L175 Difference]: Start difference. First operand has 61 places, 56 transitions, 186 flow. Second operand 3 states and 106 transitions. [2025-01-10 00:37:22,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 57 transitions, 256 flow [2025-01-10 00:37:22,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 245 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:22,267 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 179 flow [2025-01-10 00:37:22,270 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2025-01-10 00:37:22,271 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-01-10 00:37:22,272 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 179 flow [2025-01-10 00:37:22,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 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-01-10 00:37:22,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:22,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:22,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:37:22,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:22,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:22,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1382386629, now seen corresponding path program 1 times [2025-01-10 00:37:22,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086787985] [2025-01-10 00:37:22,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:22,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:22,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:22,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:22,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:22,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:22,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:22,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086787985] [2025-01-10 00:37:22,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086787985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:22,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:22,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:22,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735127675] [2025-01-10 00:37:22,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:22,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:22,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:22,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:22,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:22,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 59 [2025-01-10 00:37:22,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:22,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:22,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 59 [2025-01-10 00:37:22,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:22,664 INFO L124 PetriNetUnfolderBase]: 271/796 cut-off events. [2025-01-10 00:37:22,664 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-01-10 00:37:22,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 796 events. 271/796 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6250 event pairs, 64 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 1614. Up to 238 conditions per place. [2025-01-10 00:37:22,671 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 41 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2025-01-10 00:37:22,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 357 flow [2025-01-10 00:37:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2025-01-10 00:37:22,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2025-01-10 00:37:22,672 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 179 flow. Second operand 5 states and 175 transitions. [2025-01-10 00:37:22,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 357 flow [2025-01-10 00:37:22,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:22,677 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 268 flow [2025-01-10 00:37:22,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-01-10 00:37:22,677 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2025-01-10 00:37:22,677 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 268 flow [2025-01-10 00:37:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:22,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:22,678 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:22,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:37:22,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:22,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:22,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1427553297, now seen corresponding path program 1 times [2025-01-10 00:37:22,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:22,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788461256] [2025-01-10 00:37:22,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:22,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:22,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:22,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:22,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:22,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:23,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:23,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788461256] [2025-01-10 00:37:23,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788461256] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:23,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:23,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:23,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8842234] [2025-01-10 00:37:23,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:37:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:23,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:37:23,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:37:23,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 59 [2025-01-10 00:37:23,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:23,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:23,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 59 [2025-01-10 00:37:23,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:23,194 INFO L124 PetriNetUnfolderBase]: 111/414 cut-off events. [2025-01-10 00:37:23,195 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-01-10 00:37:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 414 events. 111/414 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2687 event pairs, 94 based on Foata normal form. 4/386 useless extension candidates. Maximal degree in co-relation 978. Up to 247 conditions per place. [2025-01-10 00:37:23,198 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 39 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-01-10 00:37:23,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 67 transitions, 372 flow [2025-01-10 00:37:23,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2025-01-10 00:37:23,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.576271186440678 [2025-01-10 00:37:23,199 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 268 flow. Second operand 5 states and 170 transitions. [2025-01-10 00:37:23,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 67 transitions, 372 flow [2025-01-10 00:37:23,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:23,203 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 276 flow [2025-01-10 00:37:23,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-01-10 00:37:23,203 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2025-01-10 00:37:23,203 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 276 flow [2025-01-10 00:37:23,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:23,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:23,204 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:23,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:37:23,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 12 more)] === [2025-01-10 00:37:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1304478929, now seen corresponding path program 1 times [2025-01-10 00:37:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835024247] [2025-01-10 00:37:23,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:23,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:37:23,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:37:23,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:23,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:23,225 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:37:23,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:37:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:37:23,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:23,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:23,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:37:23,263 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:37:23,264 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-10 00:37:23,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (13 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (12 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (11 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (2 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2025-01-10 00:37:23,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2025-01-10 00:37:23,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:37:23,269 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:23,272 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:37:23,272 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:37:23,299 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-10 00:37:23,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 80 transitions, 204 flow [2025-01-10 00:37:23,341 INFO L124 PetriNetUnfolderBase]: 71/450 cut-off events. [2025-01-10 00:37:23,341 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-01-10 00:37:23,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 450 events. 71/450 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2810 event pairs, 2 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 276. Up to 32 conditions per place. [2025-01-10 00:37:23,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 80 transitions, 204 flow [2025-01-10 00:37:23,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 80 transitions, 204 flow [2025-01-10 00:37:23,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:23,347 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;@2f356e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:23,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-10 00:37:23,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:23,349 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:37:23,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:37:23,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:23,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:37:23,349 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:23,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash 13560634, now seen corresponding path program 1 times [2025-01-10 00:37:23,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:23,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143321848] [2025-01-10 00:37:23,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:23,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:23,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:37:23,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:37:23,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:23,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:23,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:23,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143321848] [2025-01-10 00:37:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143321848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:23,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:37:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758723356] [2025-01-10 00:37:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:23,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:37:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:23,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:37:23,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:37:23,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 80 [2025-01-10 00:37:23,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 204 flow. Second operand has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:23,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:23,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 80 [2025-01-10 00:37:23,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:23,837 INFO L124 PetriNetUnfolderBase]: 1996/4913 cut-off events. [2025-01-10 00:37:23,837 INFO L125 PetriNetUnfolderBase]: For 1152/1152 co-relation queries the response was YES. [2025-01-10 00:37:23,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8416 conditions, 4913 events. 1996/4913 cut-off events. For 1152/1152 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 46903 event pairs, 1718 based on Foata normal form. 1035/4803 useless extension candidates. Maximal degree in co-relation 3153. Up to 3077 conditions per place. [2025-01-10 00:37:23,876 INFO L140 encePairwiseOnDemand]: 73/80 looper letters, 33 selfloop transitions, 0 changer transitions 0/71 dead transitions. [2025-01-10 00:37:23,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 71 transitions, 252 flow [2025-01-10 00:37:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:37:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:37:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2025-01-10 00:37:23,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.725 [2025-01-10 00:37:23,877 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 204 flow. Second operand 2 states and 116 transitions. [2025-01-10 00:37:23,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 71 transitions, 252 flow [2025-01-10 00:37:23,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:23,880 INFO L231 Difference]: Finished difference. Result has 72 places, 71 transitions, 186 flow [2025-01-10 00:37:23,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=186, PETRI_PLACES=72, PETRI_TRANSITIONS=71} [2025-01-10 00:37:23,882 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-01-10 00:37:23,883 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 186 flow [2025-01-10 00:37:23,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:23,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:23,884 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:37:23,884 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:23,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:23,884 INFO L85 PathProgramCache]: Analyzing trace with hash 420377029, now seen corresponding path program 1 times [2025-01-10 00:37:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154666551] [2025-01-10 00:37:23,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:23,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:23,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:23,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:23,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:23,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:23,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154666551] [2025-01-10 00:37:23,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154666551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:23,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:23,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:23,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223291006] [2025-01-10 00:37:23,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:23,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:23,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:23,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:23,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 80 [2025-01-10 00:37:23,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:23,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:23,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 80 [2025-01-10 00:37:23,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:24,349 INFO L124 PetriNetUnfolderBase]: 2241/4944 cut-off events. [2025-01-10 00:37:24,349 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2025-01-10 00:37:24,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8844 conditions, 4944 events. 2241/4944 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 44569 event pairs, 1564 based on Foata normal form. 0/4098 useless extension candidates. Maximal degree in co-relation 8837. Up to 2701 conditions per place. [2025-01-10 00:37:24,384 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 39 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2025-01-10 00:37:24,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 276 flow [2025-01-10 00:37:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-01-10 00:37:24,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-10 00:37:24,387 INFO L175 Difference]: Start difference. First operand has 72 places, 71 transitions, 186 flow. Second operand 3 states and 145 transitions. [2025-01-10 00:37:24,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 276 flow [2025-01-10 00:37:24,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 75 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:24,391 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 186 flow [2025-01-10 00:37:24,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2025-01-10 00:37:24,392 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2025-01-10 00:37:24,393 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 186 flow [2025-01-10 00:37:24,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:24,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:24,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:24,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:37:24,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:24,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash 420377030, now seen corresponding path program 1 times [2025-01-10 00:37:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:24,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161325758] [2025-01-10 00:37:24,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:24,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:24,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:24,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:24,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:24,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:24,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161325758] [2025-01-10 00:37:24,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161325758] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:24,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:24,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:24,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741658860] [2025-01-10 00:37:24,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:24,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:24,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:24,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:24,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:24,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 80 [2025-01-10 00:37:24,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:24,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:24,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 80 [2025-01-10 00:37:24,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:25,432 INFO L124 PetriNetUnfolderBase]: 4433/9850 cut-off events. [2025-01-10 00:37:25,432 INFO L125 PetriNetUnfolderBase]: For 2286/2286 co-relation queries the response was YES. [2025-01-10 00:37:25,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17834 conditions, 9850 events. 4433/9850 cut-off events. For 2286/2286 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 100294 event pairs, 3894 based on Foata normal form. 1/8186 useless extension candidates. Maximal degree in co-relation 17826. Up to 3472 conditions per place. [2025-01-10 00:37:25,569 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 66 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2025-01-10 00:37:25,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 440 flow [2025-01-10 00:37:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 216 transitions. [2025-01-10 00:37:25,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-01-10 00:37:25,571 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 186 flow. Second operand 4 states and 216 transitions. [2025-01-10 00:37:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 440 flow [2025-01-10 00:37:25,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:25,588 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 208 flow [2025-01-10 00:37:25,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2025-01-10 00:37:25,590 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 0 predicate places. [2025-01-10 00:37:25,590 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 208 flow [2025-01-10 00:37:25,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:25,591 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:25,591 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 00:37:25,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -581496881, now seen corresponding path program 1 times [2025-01-10 00:37:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824454656] [2025-01-10 00:37:25,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:25,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:37:25,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:37:25,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:25,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824454656] [2025-01-10 00:37:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824454656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:25,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272655700] [2025-01-10 00:37:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:25,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:25,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:25,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 80 [2025-01-10 00:37:25,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:25,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:25,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 80 [2025-01-10 00:37:25,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:26,627 INFO L124 PetriNetUnfolderBase]: 5403/10829 cut-off events. [2025-01-10 00:37:26,628 INFO L125 PetriNetUnfolderBase]: For 1618/1618 co-relation queries the response was YES. [2025-01-10 00:37:26,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20133 conditions, 10829 events. 5403/10829 cut-off events. For 1618/1618 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 106098 event pairs, 4876 based on Foata normal form. 1/8444 useless extension candidates. Maximal degree in co-relation 20123. Up to 8400 conditions per place. [2025-01-10 00:37:26,689 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 46 selfloop transitions, 7 changer transitions 2/86 dead transitions. [2025-01-10 00:37:26,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 86 transitions, 355 flow [2025-01-10 00:37:26,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-01-10 00:37:26,693 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584375 [2025-01-10 00:37:26,693 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 208 flow. Second operand 4 states and 187 transitions. [2025-01-10 00:37:26,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 86 transitions, 355 flow [2025-01-10 00:37:26,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:26,696 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 252 flow [2025-01-10 00:37:26,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-01-10 00:37:26,697 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-01-10 00:37:26,698 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 252 flow [2025-01-10 00:37:26,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:26,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:26,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:37:26,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash -846535406, now seen corresponding path program 1 times [2025-01-10 00:37:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393562298] [2025-01-10 00:37:26,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:26,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:26,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:26,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:26,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:26,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393562298] [2025-01-10 00:37:26,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393562298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:26,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:26,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:26,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234348608] [2025-01-10 00:37:26,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:26,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:26,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:26,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:26,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:26,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 80 [2025-01-10 00:37:26,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:26,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:26,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 80 [2025-01-10 00:37:26,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:27,558 INFO L124 PetriNetUnfolderBase]: 4735/9573 cut-off events. [2025-01-10 00:37:27,559 INFO L125 PetriNetUnfolderBase]: For 1681/1681 co-relation queries the response was YES. [2025-01-10 00:37:27,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18847 conditions, 9573 events. 4735/9573 cut-off events. For 1681/1681 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 91454 event pairs, 3414 based on Foata normal form. 0/8840 useless extension candidates. Maximal degree in co-relation 18835. Up to 5776 conditions per place. [2025-01-10 00:37:27,644 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 43 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2025-01-10 00:37:27,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 79 transitions, 354 flow [2025-01-10 00:37:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2025-01-10 00:37:27,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-10 00:37:27,646 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 252 flow. Second operand 3 states and 145 transitions. [2025-01-10 00:37:27,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 79 transitions, 354 flow [2025-01-10 00:37:27,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 346 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:27,654 INFO L231 Difference]: Finished difference. Result has 78 places, 73 transitions, 248 flow [2025-01-10 00:37:27,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=78, PETRI_TRANSITIONS=73} [2025-01-10 00:37:27,656 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-01-10 00:37:27,656 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 73 transitions, 248 flow [2025-01-10 00:37:27,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:27,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:27,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:27,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:37:27,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:27,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash -846535405, now seen corresponding path program 1 times [2025-01-10 00:37:27,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:27,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112988466] [2025-01-10 00:37:27,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:27,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:27,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:27,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:27,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:27,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:27,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112988466] [2025-01-10 00:37:27,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112988466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:27,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:27,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:27,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546772710] [2025-01-10 00:37:27,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:27,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:27,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:27,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:27,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 80 [2025-01-10 00:37:27,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 73 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:27,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:27,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 80 [2025-01-10 00:37:27,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:28,861 INFO L124 PetriNetUnfolderBase]: 7410/13329 cut-off events. [2025-01-10 00:37:28,862 INFO L125 PetriNetUnfolderBase]: For 2811/2811 co-relation queries the response was YES. [2025-01-10 00:37:28,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27570 conditions, 13329 events. 7410/13329 cut-off events. For 2811/2811 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 121749 event pairs, 1446 based on Foata normal form. 0/12087 useless extension candidates. Maximal degree in co-relation 27558. Up to 5622 conditions per place. [2025-01-10 00:37:28,934 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 65 selfloop transitions, 16 changer transitions 0/110 dead transitions. [2025-01-10 00:37:28,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 516 flow [2025-01-10 00:37:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 244 transitions. [2025-01-10 00:37:28,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-01-10 00:37:28,938 INFO L175 Difference]: Start difference. First operand has 78 places, 73 transitions, 248 flow. Second operand 5 states and 244 transitions. [2025-01-10 00:37:28,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 516 flow [2025-01-10 00:37:28,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 110 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:28,963 INFO L231 Difference]: Finished difference. Result has 83 places, 82 transitions, 343 flow [2025-01-10 00:37:28,963 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=83, PETRI_TRANSITIONS=82} [2025-01-10 00:37:28,965 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2025-01-10 00:37:28,965 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 82 transitions, 343 flow [2025-01-10 00:37:28,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:28,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:28,966 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:28,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:37:28,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:28,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:28,967 INFO L85 PathProgramCache]: Analyzing trace with hash 638968621, now seen corresponding path program 1 times [2025-01-10 00:37:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595837325] [2025-01-10 00:37:28,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:28,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:28,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:37:28,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:37:28,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:28,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:29,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:29,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595837325] [2025-01-10 00:37:29,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595837325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:29,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:29,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:29,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468149965] [2025-01-10 00:37:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:29,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:37:29,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:29,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:37:29,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:37:29,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 80 [2025-01-10 00:37:29,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:29,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:29,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 80 [2025-01-10 00:37:29,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:30,111 INFO L124 PetriNetUnfolderBase]: 5271/11041 cut-off events. [2025-01-10 00:37:30,112 INFO L125 PetriNetUnfolderBase]: For 4450/4450 co-relation queries the response was YES. [2025-01-10 00:37:30,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25700 conditions, 11041 events. 5271/11041 cut-off events. For 4450/4450 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 109865 event pairs, 4206 based on Foata normal form. 4/10586 useless extension candidates. Maximal degree in co-relation 25685. Up to 4348 conditions per place. [2025-01-10 00:37:30,160 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 87 selfloop transitions, 5 changer transitions 0/125 dead transitions. [2025-01-10 00:37:30,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 725 flow [2025-01-10 00:37:30,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 255 transitions. [2025-01-10 00:37:30,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6375 [2025-01-10 00:37:30,162 INFO L175 Difference]: Start difference. First operand has 83 places, 82 transitions, 343 flow. Second operand 5 states and 255 transitions. [2025-01-10 00:37:30,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 725 flow [2025-01-10 00:37:30,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 718 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:30,173 INFO L231 Difference]: Finished difference. Result has 87 places, 83 transitions, 362 flow [2025-01-10 00:37:30,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2025-01-10 00:37:30,175 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 12 predicate places. [2025-01-10 00:37:30,175 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 362 flow [2025-01-10 00:37:30,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:30,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:30,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:30,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 00:37:30,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:30,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1771717630, now seen corresponding path program 1 times [2025-01-10 00:37:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:30,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34209344] [2025-01-10 00:37:30,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:30,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 00:37:30,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 00:37:30,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:30,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:30,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:30,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34209344] [2025-01-10 00:37:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34209344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:30,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:30,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469922116] [2025-01-10 00:37:30,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:30,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:37:30,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:30,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:37:30,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:37:30,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 80 [2025-01-10 00:37:30,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:30,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:30,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 80 [2025-01-10 00:37:30,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:31,224 INFO L124 PetriNetUnfolderBase]: 4679/10161 cut-off events. [2025-01-10 00:37:31,225 INFO L125 PetriNetUnfolderBase]: For 4492/4492 co-relation queries the response was YES. [2025-01-10 00:37:31,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23393 conditions, 10161 events. 4679/10161 cut-off events. For 4492/4492 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 100903 event pairs, 3262 based on Foata normal form. 0/9414 useless extension candidates. Maximal degree in co-relation 23377. Up to 5414 conditions per place. [2025-01-10 00:37:31,282 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 48 selfloop transitions, 5 changer transitions 1/88 dead transitions. [2025-01-10 00:37:31,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 480 flow [2025-01-10 00:37:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:37:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:37:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 188 transitions. [2025-01-10 00:37:31,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5875 [2025-01-10 00:37:31,284 INFO L175 Difference]: Start difference. First operand has 87 places, 83 transitions, 362 flow. Second operand 4 states and 188 transitions. [2025-01-10 00:37:31,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 480 flow [2025-01-10 00:37:31,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 88 transitions, 468 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:31,293 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 352 flow [2025-01-10 00:37:31,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2025-01-10 00:37:31,294 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2025-01-10 00:37:31,294 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 352 flow [2025-01-10 00:37:31,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:31,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:31,295 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:31,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 00:37:31,295 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:31,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash 962483382, now seen corresponding path program 1 times [2025-01-10 00:37:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:31,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773614612] [2025-01-10 00:37:31,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:31,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 00:37:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 00:37:31,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:31,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:31,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773614612] [2025-01-10 00:37:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773614612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:31,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:31,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:31,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939502471] [2025-01-10 00:37:31,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:31,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:37:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:31,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:37:31,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:37:31,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 80 [2025-01-10 00:37:31,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:31,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:31,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 80 [2025-01-10 00:37:31,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:32,714 INFO L124 PetriNetUnfolderBase]: 6125/11403 cut-off events. [2025-01-10 00:37:32,714 INFO L125 PetriNetUnfolderBase]: For 4424/4424 co-relation queries the response was YES. [2025-01-10 00:37:32,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27415 conditions, 11403 events. 6125/11403 cut-off events. For 4424/4424 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 105231 event pairs, 1302 based on Foata normal form. 10/10834 useless extension candidates. Maximal degree in co-relation 27399. Up to 3719 conditions per place. [2025-01-10 00:37:32,784 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 62 selfloop transitions, 18 changer transitions 0/109 dead transitions. [2025-01-10 00:37:32,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 109 transitions, 588 flow [2025-01-10 00:37:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:32,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2025-01-10 00:37:32,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6075 [2025-01-10 00:37:32,786 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 352 flow. Second operand 5 states and 243 transitions. [2025-01-10 00:37:32,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 109 transitions, 588 flow [2025-01-10 00:37:32,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 109 transitions, 578 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:37:32,837 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 398 flow [2025-01-10 00:37:32,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-01-10 00:37:32,838 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2025-01-10 00:37:32,838 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 398 flow [2025-01-10 00:37:32,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.666666666666664) internal successors, (208), 6 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:32,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:32,838 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:32,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 00:37:32,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:32,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1789096339, now seen corresponding path program 1 times [2025-01-10 00:37:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134956455] [2025-01-10 00:37:32,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:32,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:32,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 00:37:32,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 00:37:32,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:32,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:33,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:33,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134956455] [2025-01-10 00:37:33,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134956455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:33,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 00:37:33,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405481032] [2025-01-10 00:37:33,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:33,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:37:33,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:33,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:37:33,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:37:33,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 80 [2025-01-10 00:37:33,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 398 flow. Second operand has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:33,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:33,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 80 [2025-01-10 00:37:33,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:34,012 INFO L124 PetriNetUnfolderBase]: 6533/11385 cut-off events. [2025-01-10 00:37:34,012 INFO L125 PetriNetUnfolderBase]: For 6883/6883 co-relation queries the response was YES. [2025-01-10 00:37:34,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29856 conditions, 11385 events. 6533/11385 cut-off events. For 6883/6883 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 101233 event pairs, 2428 based on Foata normal form. 348/11414 useless extension candidates. Maximal degree in co-relation 29838. Up to 4036 conditions per place. [2025-01-10 00:37:34,085 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 62 selfloop transitions, 17 changer transitions 0/107 dead transitions. [2025-01-10 00:37:34,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 107 transitions, 628 flow [2025-01-10 00:37:34,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 242 transitions. [2025-01-10 00:37:34,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.605 [2025-01-10 00:37:34,087 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 398 flow. Second operand 5 states and 242 transitions. [2025-01-10 00:37:34,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 107 transitions, 628 flow [2025-01-10 00:37:34,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 107 transitions, 591 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-10 00:37:34,113 INFO L231 Difference]: Finished difference. Result has 86 places, 79 transitions, 387 flow [2025-01-10 00:37:34,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2025-01-10 00:37:34,113 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2025-01-10 00:37:34,113 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 387 flow [2025-01-10 00:37:34,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.57142857142857) internal successors, (242), 7 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:34,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:34,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:34,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 00:37:34,114 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:34,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1528521385, now seen corresponding path program 1 times [2025-01-10 00:37:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:34,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359734749] [2025-01-10 00:37:34,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:34,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:37:34,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:37:34,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:34,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359734749] [2025-01-10 00:37:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359734749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:34,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:34,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:34,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166090057] [2025-01-10 00:37:34,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:34,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:34,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:34,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:34,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 80 [2025-01-10 00:37:34,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:34,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:34,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 80 [2025-01-10 00:37:34,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:35,157 INFO L124 PetriNetUnfolderBase]: 5331/10574 cut-off events. [2025-01-10 00:37:35,157 INFO L125 PetriNetUnfolderBase]: For 7372/7372 co-relation queries the response was YES. [2025-01-10 00:37:35,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27836 conditions, 10574 events. 5331/10574 cut-off events. For 7372/7372 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 99757 event pairs, 2275 based on Foata normal form. 130/10367 useless extension candidates. Maximal degree in co-relation 27819. Up to 3416 conditions per place. [2025-01-10 00:37:35,197 INFO L140 encePairwiseOnDemand]: 69/80 looper letters, 76 selfloop transitions, 14 changer transitions 5/124 dead transitions. [2025-01-10 00:37:35,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 124 transitions, 780 flow [2025-01-10 00:37:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:35,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 259 transitions. [2025-01-10 00:37:35,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6475 [2025-01-10 00:37:35,198 INFO L175 Difference]: Start difference. First operand has 86 places, 79 transitions, 387 flow. Second operand 5 states and 259 transitions. [2025-01-10 00:37:35,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 124 transitions, 780 flow [2025-01-10 00:37:35,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 124 transitions, 716 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-01-10 00:37:35,213 INFO L231 Difference]: Finished difference. Result has 89 places, 85 transitions, 451 flow [2025-01-10 00:37:35,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=451, PETRI_PLACES=89, PETRI_TRANSITIONS=85} [2025-01-10 00:37:35,213 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-01-10 00:37:35,213 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 85 transitions, 451 flow [2025-01-10 00:37:35,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:35,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:35,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:35,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-10 00:37:35,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:35,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash 372587880, now seen corresponding path program 1 times [2025-01-10 00:37:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:35,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048170922] [2025-01-10 00:37:35,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:35,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:35,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:37:35,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:37:35,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:35,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:35,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048170922] [2025-01-10 00:37:35,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048170922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:35,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:35,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:35,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534353665] [2025-01-10 00:37:35,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:35,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:35,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:35,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:35,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 80 [2025-01-10 00:37:35,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 85 transitions, 451 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:35,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:35,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 80 [2025-01-10 00:37:35,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:36,089 INFO L124 PetriNetUnfolderBase]: 6207/12188 cut-off events. [2025-01-10 00:37:36,089 INFO L125 PetriNetUnfolderBase]: For 12308/12308 co-relation queries the response was YES. [2025-01-10 00:37:36,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31756 conditions, 12188 events. 6207/12188 cut-off events. For 12308/12308 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 118555 event pairs, 2768 based on Foata normal form. 12/11947 useless extension candidates. Maximal degree in co-relation 31738. Up to 3569 conditions per place. [2025-01-10 00:37:36,160 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 81 selfloop transitions, 18 changer transitions 0/129 dead transitions. [2025-01-10 00:37:36,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 809 flow [2025-01-10 00:37:36,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 00:37:36,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 00:37:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 279 transitions. [2025-01-10 00:37:36,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6975 [2025-01-10 00:37:36,162 INFO L175 Difference]: Start difference. First operand has 89 places, 85 transitions, 451 flow. Second operand 5 states and 279 transitions. [2025-01-10 00:37:36,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 809 flow [2025-01-10 00:37:36,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 779 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 00:37:36,179 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 486 flow [2025-01-10 00:37:36,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=486, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2025-01-10 00:37:36,180 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 17 predicate places. [2025-01-10 00:37:36,180 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 486 flow [2025-01-10 00:37:36,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:36,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:36,180 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:36,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-10 00:37:36,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:36,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash 527364745, now seen corresponding path program 1 times [2025-01-10 00:37:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:36,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015589922] [2025-01-10 00:37:36,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:36,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 00:37:36,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 00:37:36,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:36,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:36,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015589922] [2025-01-10 00:37:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015589922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:36,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:36,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:37:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631898642] [2025-01-10 00:37:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:36,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:37:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:36,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:37:36,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:37:36,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 80 [2025-01-10 00:37:36,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:36,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:36,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 80 [2025-01-10 00:37:36,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:37,253 INFO L124 PetriNetUnfolderBase]: 6176/12018 cut-off events. [2025-01-10 00:37:37,253 INFO L125 PetriNetUnfolderBase]: For 13741/13741 co-relation queries the response was YES. [2025-01-10 00:37:37,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33047 conditions, 12018 events. 6176/12018 cut-off events. For 13741/13741 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 117576 event pairs, 3697 based on Foata normal form. 48/11704 useless extension candidates. Maximal degree in co-relation 33028. Up to 5320 conditions per place. [2025-01-10 00:37:37,314 INFO L140 encePairwiseOnDemand]: 67/80 looper letters, 121 selfloop transitions, 22 changer transitions 0/173 dead transitions. [2025-01-10 00:37:37,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 173 transitions, 1212 flow [2025-01-10 00:37:37,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 00:37:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 00:37:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 385 transitions. [2025-01-10 00:37:37,315 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-01-10 00:37:37,315 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 486 flow. Second operand 7 states and 385 transitions. [2025-01-10 00:37:37,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 173 transitions, 1212 flow [2025-01-10 00:37:37,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 173 transitions, 1197 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:37,341 INFO L231 Difference]: Finished difference. Result has 101 places, 103 transitions, 756 flow [2025-01-10 00:37:37,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=756, PETRI_PLACES=101, PETRI_TRANSITIONS=103} [2025-01-10 00:37:37,342 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 26 predicate places. [2025-01-10 00:37:37,342 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 103 transitions, 756 flow [2025-01-10 00:37:37,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:37,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:37,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:37,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-10 00:37:37,343 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:37,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -906407348, now seen corresponding path program 1 times [2025-01-10 00:37:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868967641] [2025-01-10 00:37:37,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:37,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:37,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 00:37:37,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 00:37:37,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:37,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:37,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:37,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868967641] [2025-01-10 00:37:37,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868967641] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:37,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:37,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:37:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65997744] [2025-01-10 00:37:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:37,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:37,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:37,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:37,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:37,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 80 [2025-01-10 00:37:37,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 103 transitions, 756 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:37,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:37,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 80 [2025-01-10 00:37:37,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:43,686 INFO L124 PetriNetUnfolderBase]: 51902/84525 cut-off events. [2025-01-10 00:37:43,687 INFO L125 PetriNetUnfolderBase]: For 195219/196483 co-relation queries the response was YES. [2025-01-10 00:37:43,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249577 conditions, 84525 events. 51902/84525 cut-off events. For 195219/196483 co-relation queries the response was YES. Maximal size of possible extension queue 4494. Compared 815051 event pairs, 18764 based on Foata normal form. 0/82475 useless extension candidates. Maximal degree in co-relation 249554. Up to 46421 conditions per place. [2025-01-10 00:37:44,162 INFO L140 encePairwiseOnDemand]: 72/80 looper letters, 294 selfloop transitions, 14 changer transitions 27/360 dead transitions. [2025-01-10 00:37:44,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 360 transitions, 3854 flow [2025-01-10 00:37:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 00:37:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 00:37:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 413 transitions. [2025-01-10 00:37:44,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6453125 [2025-01-10 00:37:44,164 INFO L175 Difference]: Start difference. First operand has 101 places, 103 transitions, 756 flow. Second operand 8 states and 413 transitions. [2025-01-10 00:37:44,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 360 transitions, 3854 flow [2025-01-10 00:37:45,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 360 transitions, 3801 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-01-10 00:37:45,119 INFO L231 Difference]: Finished difference. Result has 113 places, 116 transitions, 849 flow [2025-01-10 00:37:45,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=849, PETRI_PLACES=113, PETRI_TRANSITIONS=116} [2025-01-10 00:37:45,120 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 38 predicate places. [2025-01-10 00:37:45,120 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 116 transitions, 849 flow [2025-01-10 00:37:45,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:45,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:45,120 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:45,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-10 00:37:45,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 13 more)] === [2025-01-10 00:37:45,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1769140576, now seen corresponding path program 1 times [2025-01-10 00:37:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:45,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135042885] [2025-01-10 00:37:45,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:45,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:45,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:45,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:45,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:45,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:37:45,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 00:37:45,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 00:37:45,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:45,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:37:45,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:37:45,150 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:37:45,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX (13 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (12 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2025-01-10 00:37:45,151 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2025-01-10 00:37:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 16 remaining) [2025-01-10 00:37:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 16 remaining) [2025-01-10 00:37:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (3 of 16 remaining) [2025-01-10 00:37:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2025-01-10 00:37:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 16 remaining) [2025-01-10 00:37:45,152 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2025-01-10 00:37:45,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-10 00:37:45,152 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:37:45,153 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:37:45,153 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 00:37:45,182 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-01-10 00:37:45,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 101 transitions, 274 flow [2025-01-10 00:37:45,275 INFO L124 PetriNetUnfolderBase]: 362/1567 cut-off events. [2025-01-10 00:37:45,275 INFO L125 PetriNetUnfolderBase]: For 419/431 co-relation queries the response was YES. [2025-01-10 00:37:45,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2003 conditions, 1567 events. 362/1567 cut-off events. For 419/431 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 11834 event pairs, 52 based on Foata normal form. 0/1019 useless extension candidates. Maximal degree in co-relation 1009. Up to 192 conditions per place. [2025-01-10 00:37:45,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 101 transitions, 274 flow [2025-01-10 00:37:45,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 101 transitions, 274 flow [2025-01-10 00:37:45,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:37:45,296 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;@2f356e0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:37:45,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 00:37:45,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:37:45,298 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:37:45,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:37:45,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:45,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:37:45,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:37:45,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 16608250, now seen corresponding path program 1 times [2025-01-10 00:37:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:45,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126546777] [2025-01-10 00:37:45,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:45,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:37:45,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:37:45,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:45,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:45,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:45,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126546777] [2025-01-10 00:37:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126546777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:45,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:37:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198577058] [2025-01-10 00:37:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:45,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 00:37:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:45,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 00:37:45,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 00:37:45,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 101 [2025-01-10 00:37:45,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 274 flow. Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:45,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:45,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 101 [2025-01-10 00:37:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:49,866 INFO L124 PetriNetUnfolderBase]: 34066/64837 cut-off events. [2025-01-10 00:37:49,866 INFO L125 PetriNetUnfolderBase]: For 20374/20374 co-relation queries the response was YES. [2025-01-10 00:37:50,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117455 conditions, 64837 events. 34066/64837 cut-off events. For 20374/20374 co-relation queries the response was YES. Maximal size of possible extension queue 2980. Compared 713406 event pairs, 29642 based on Foata normal form. 17554/71783 useless extension candidates. Maximal degree in co-relation 37009. Up to 45834 conditions per place. [2025-01-10 00:37:50,286 INFO L140 encePairwiseOnDemand]: 92/101 looper letters, 42 selfloop transitions, 0 changer transitions 0/89 dead transitions. [2025-01-10 00:37:50,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 89 transitions, 334 flow [2025-01-10 00:37:50,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 00:37:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-01-10 00:37:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 145 transitions. [2025-01-10 00:37:50,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7178217821782178 [2025-01-10 00:37:50,287 INFO L175 Difference]: Start difference. First operand has 94 places, 101 transitions, 274 flow. Second operand 2 states and 145 transitions. [2025-01-10 00:37:50,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 89 transitions, 334 flow [2025-01-10 00:37:50,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:50,298 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 250 flow [2025-01-10 00:37:50,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=250, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-01-10 00:37:50,298 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -4 predicate places. [2025-01-10 00:37:50,298 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 250 flow [2025-01-10 00:37:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:50,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:50,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-10 00:37:50,299 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:37:50,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:50,299 INFO L85 PathProgramCache]: Analyzing trace with hash 514853224, now seen corresponding path program 1 times [2025-01-10 00:37:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-01-10 00:37:50,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:50,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:50,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:50,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:50,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909899214] [2025-01-10 00:37:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909899214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:50,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:50,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:37:50,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392568760] [2025-01-10 00:37:50,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:50,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:37:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:50,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:37:50,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:37:50,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 101 [2025-01-10 00:37:50,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:50,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:50,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 101 [2025-01-10 00:37:50,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:37:54,708 INFO L124 PetriNetUnfolderBase]: 38403/67431 cut-off events. [2025-01-10 00:37:54,708 INFO L125 PetriNetUnfolderBase]: For 14309/14309 co-relation queries the response was YES. [2025-01-10 00:37:54,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126130 conditions, 67431 events. 38403/67431 cut-off events. For 14309/14309 co-relation queries the response was YES. Maximal size of possible extension queue 3140. Compared 693138 event pairs, 25339 based on Foata normal form. 0/60302 useless extension candidates. Maximal degree in co-relation 126121. Up to 39814 conditions per place. [2025-01-10 00:37:55,297 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 51 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-01-10 00:37:55,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 96 transitions, 370 flow [2025-01-10 00:37:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:37:55,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:37:55,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2025-01-10 00:37:55,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6072607260726073 [2025-01-10 00:37:55,298 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 250 flow. Second operand 3 states and 184 transitions. [2025-01-10 00:37:55,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 96 transitions, 370 flow [2025-01-10 00:37:55,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 96 transitions, 370 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:37:55,302 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 250 flow [2025-01-10 00:37:55,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-01-10 00:37:55,302 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -4 predicate places. [2025-01-10 00:37:55,302 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 250 flow [2025-01-10 00:37:55,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:55,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:37:55,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:37:55,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-10 00:37:55,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:37:55,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:37:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 514853225, now seen corresponding path program 1 times [2025-01-10 00:37:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:37:55,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516031246] [2025-01-10 00:37:55,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:37:55,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:37:55,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:37:55,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:37:55,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:37:55,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:37:55,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:37:55,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:37:55,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516031246] [2025-01-10 00:37:55,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516031246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:37:55,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:37:55,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:37:55,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936202662] [2025-01-10 00:37:55,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:37:55,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:37:55,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:37:55,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:37:55,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:37:55,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 101 [2025-01-10 00:37:55,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:37:55,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:37:55,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 101 [2025-01-10 00:37:55,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:38:04,366 INFO L124 PetriNetUnfolderBase]: 76586/134293 cut-off events. [2025-01-10 00:38:04,366 INFO L125 PetriNetUnfolderBase]: For 40604/40604 co-relation queries the response was YES. [2025-01-10 00:38:04,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254753 conditions, 134293 events. 76586/134293 cut-off events. For 40604/40604 co-relation queries the response was YES. Maximal size of possible extension queue 6192. Compared 1486510 event pairs, 67803 based on Foata normal form. 1/119909 useless extension candidates. Maximal degree in co-relation 254743. Up to 51913 conditions per place. [2025-01-10 00:38:05,536 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 84 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-01-10 00:38:05,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 131 transitions, 584 flow [2025-01-10 00:38:05,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:38:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:38:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 270 transitions. [2025-01-10 00:38:05,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6683168316831684 [2025-01-10 00:38:05,538 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 250 flow. Second operand 4 states and 270 transitions. [2025-01-10 00:38:05,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 131 transitions, 584 flow [2025-01-10 00:38:06,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 131 transitions, 576 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:38:06,495 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 272 flow [2025-01-10 00:38:06,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2025-01-10 00:38:06,495 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -1 predicate places. [2025-01-10 00:38:06,495 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 272 flow [2025-01-10 00:38:06,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:06,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:38:06,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:38:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-10 00:38:06,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [checkThreadErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr1ASSERT_VIOLATIONARRAY_INDEX (and 14 more)] === [2025-01-10 00:38:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:38:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 755347791, now seen corresponding path program 1 times [2025-01-10 00:38:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:38:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214441967] [2025-01-10 00:38:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:38:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:38:06,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:38:06,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:38:06,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:38:06,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:38:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:38:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:38:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214441967] [2025-01-10 00:38:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214441967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:38:06,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:38:06,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:38:06,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038887335] [2025-01-10 00:38:06,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:38:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:38:06,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:38:06,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:38:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:38:06,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 101 [2025-01-10 00:38:06,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:38:06,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:38:06,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 101 [2025-01-10 00:38:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand