./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.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/goblint-regression/28-race_reach_72-funloop_hard_racing.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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:59,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:59,219 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:58:59,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:59,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:59,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:59,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:59,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:59,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:59,248 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:59,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:59,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:59,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:59,249 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:59,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:59,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:59,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:59,250 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:59,250 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-01-10 00:58:59,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:59,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:59,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:59,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:59,480 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:59,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-01-10 00:59:00,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c1944f3c/4f01965236a1458ba6492af7bfa011d9/FLAG982554e6a [2025-01-10 00:59:00,970 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:59:00,970 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-01-10 00:59:00,989 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c1944f3c/4f01965236a1458ba6492af7bfa011d9/FLAG982554e6a [2025-01-10 00:59:01,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2c1944f3c/4f01965236a1458ba6492af7bfa011d9 [2025-01-10 00:59:01,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:59:01,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:59:01,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:01,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:59:01,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:59:01,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4012b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01, skipping insertion in model container [2025-01-10 00:59:01,248 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:59:01,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:01,706 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:59:01,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:01,777 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:59:01,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01 WrapperNode [2025-01-10 00:59:01,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:01,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:01,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:59:01,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:59:01,786 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:59:01" (1/1) ... [2025-01-10 00:59:01,801 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:59:01" (1/1) ... [2025-01-10 00:59:01,822 INFO L138 Inliner]: procedures = 272, calls = 110, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 320 [2025-01-10 00:59:01,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:01,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:59:01,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:59:01,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:59:01,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,832 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,841 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 75, 5, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 60, 5, 0]. The 7 writes are split as follows [0, 6, 0, 1]. [2025-01-10 00:59:01,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:59:01,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:59:01,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:59:01,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:59:01,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (1/1) ... [2025-01-10 00:59:01,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:01,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:01,902 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:59:01,910 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:59:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:59:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:59:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:59:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:59:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:59:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:59:01,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:59:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:59:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:59:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:59:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:59:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:59:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:59:01,933 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:59:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:59:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:59:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:59:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:59:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:59:01,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:59:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:59:01,935 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:59:02,048 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:59:02,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:59:02,395 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:59:02,395 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:59:02,710 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:59:02,711 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-10 00:59:02,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:02 BoogieIcfgContainer [2025-01-10 00:59:02,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:59:02,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:59:02,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:59:02,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:59:02,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:59:01" (1/3) ... [2025-01-10 00:59:02,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336c5866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:02, skipping insertion in model container [2025-01-10 00:59:02,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:01" (2/3) ... [2025-01-10 00:59:02,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336c5866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:02, skipping insertion in model container [2025-01-10 00:59:02,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:02" (3/3) ... [2025-01-10 00:59:02,726 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-01-10 00:59:02,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:59:02,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 156 locations, 1 initial locations, 20 loop locations, and 38 error locations. [2025-01-10 00:59:02,742 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:59:02,785 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:59:02,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 199 transitions, 405 flow [2025-01-10 00:59:02,887 INFO L124 PetriNetUnfolderBase]: 70/329 cut-off events. [2025-01-10 00:59:02,889 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:59:02,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 329 events. 70/329 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1973 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 192. Up to 8 conditions per place. [2025-01-10 00:59:02,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 199 transitions, 405 flow [2025-01-10 00:59:02,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 199 transitions, 405 flow [2025-01-10 00:59:02,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:02,912 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;@4d5863c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:02,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 00:59:02,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:02,917 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:59:02,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:02,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:02,918 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:59:02,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:02,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 27737060, now seen corresponding path program 1 times [2025-01-10 00:59:02,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31955650] [2025-01-10 00:59:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:59:03,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:59:03,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:03,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,171 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:59:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:03,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31955650] [2025-01-10 00:59:03,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31955650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:03,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:03,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:03,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413015260] [2025-01-10 00:59:03,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:03,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:03,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:03,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:03,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:03,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2025-01-10 00:59:03,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 199 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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:59:03,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:03,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2025-01-10 00:59:03,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:03,661 INFO L124 PetriNetUnfolderBase]: 1062/3574 cut-off events. [2025-01-10 00:59:03,662 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:59:03,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5591 conditions, 3574 events. 1062/3574 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 32042 event pairs, 903 based on Foata normal form. 726/3793 useless extension candidates. Maximal degree in co-relation 5422. Up to 2011 conditions per place. [2025-01-10 00:59:03,694 INFO L140 encePairwiseOnDemand]: 160/199 looper letters, 71 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-01-10 00:59:03,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 161 transitions, 475 flow [2025-01-10 00:59:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:03,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2025-01-10 00:59:03,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.626465661641541 [2025-01-10 00:59:03,706 INFO L175 Difference]: Start difference. First operand has 159 places, 199 transitions, 405 flow. Second operand 3 states and 374 transitions. [2025-01-10 00:59:03,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 161 transitions, 475 flow [2025-01-10 00:59:03,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 161 transitions, 475 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:03,714 INFO L231 Difference]: Finished difference. Result has 159 places, 161 transitions, 339 flow [2025-01-10 00:59:03,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=159, PETRI_TRANSITIONS=161} [2025-01-10 00:59:03,720 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 0 predicate places. [2025-01-10 00:59:03,721 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 161 transitions, 339 flow [2025-01-10 00:59:03,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 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:59:03,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:03,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:03,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:59:03,721 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:03,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 859859272, now seen corresponding path program 1 times [2025-01-10 00:59:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033261271] [2025-01-10 00:59:03,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:03,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:03,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:03,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:03,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:03,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033261271] [2025-01-10 00:59:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033261271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113597071] [2025-01-10 00:59:03,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:03,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:03,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:03,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:59:03,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:59:03,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:03,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:03,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:03,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:59:03,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:03,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:03,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:03,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113597071] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:03,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:03,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:59:03,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939611492] [2025-01-10 00:59:03,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:03,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:59:03,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:03,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:59:03,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:59:03,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2025-01-10 00:59:03,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 161 transitions, 339 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 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:59:03,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:03,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2025-01-10 00:59:03,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,380 INFO L124 PetriNetUnfolderBase]: 1062/3577 cut-off events. [2025-01-10 00:59:04,380 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:59:04,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5607 conditions, 3577 events. 1062/3577 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 32009 event pairs, 903 based on Foata normal form. 0/3070 useless extension candidates. Maximal degree in co-relation 5595. Up to 2011 conditions per place. [2025-01-10 00:59:04,392 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 71 selfloop transitions, 5 changer transitions 0/164 dead transitions. [2025-01-10 00:59:04,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 164 transitions, 503 flow [2025-01-10 00:59:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:59:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:59:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2025-01-10 00:59:04,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5083752093802345 [2025-01-10 00:59:04,394 INFO L175 Difference]: Start difference. First operand has 159 places, 161 transitions, 339 flow. Second operand 6 states and 607 transitions. [2025-01-10 00:59:04,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 164 transitions, 503 flow [2025-01-10 00:59:04,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 164 transitions, 499 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:04,397 INFO L231 Difference]: Finished difference. Result has 166 places, 164 transitions, 371 flow [2025-01-10 00:59:04,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=166, PETRI_TRANSITIONS=164} [2025-01-10 00:59:04,398 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 7 predicate places. [2025-01-10 00:59:04,398 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 164 transitions, 371 flow [2025-01-10 00:59:04,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 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:59:04,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,398 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:04,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 00:59:04,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:04,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash 892957924, now seen corresponding path program 2 times [2025-01-10 00:59:04,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:04,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605079460] [2025-01-10 00:59:04,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:04,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 00:59:04,613 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-01-10 00:59:04,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:59:04,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:04,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605079460] [2025-01-10 00:59:04,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605079460] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:04,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:04,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022882400] [2025-01-10 00:59:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:04,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:04,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:04,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:04,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:04,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 199 [2025-01-10 00:59:04,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 164 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:59:04,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:04,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 199 [2025-01-10 00:59:04,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,987 INFO L124 PetriNetUnfolderBase]: 1108/3644 cut-off events. [2025-01-10 00:59:04,988 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 00:59:04,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5778 conditions, 3644 events. 1108/3644 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 32458 event pairs, 903 based on Foata normal form. 0/3177 useless extension candidates. Maximal degree in co-relation 5744. Up to 2007 conditions per place. [2025-01-10 00:59:04,999 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 98 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2025-01-10 00:59:05,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 184 transitions, 611 flow [2025-01-10 00:59:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2025-01-10 00:59:05,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862646566164154 [2025-01-10 00:59:05,001 INFO L175 Difference]: Start difference. First operand has 166 places, 164 transitions, 371 flow. Second operand 3 states and 350 transitions. [2025-01-10 00:59:05,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 184 transitions, 611 flow [2025-01-10 00:59:05,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 184 transitions, 597 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:05,004 INFO L231 Difference]: Finished difference. Result has 165 places, 162 transitions, 357 flow [2025-01-10 00:59:05,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=357, PETRI_PLACES=165, PETRI_TRANSITIONS=162} [2025-01-10 00:59:05,009 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 6 predicate places. [2025-01-10 00:59:05,009 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 162 transitions, 357 flow [2025-01-10 00:59:05,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 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:59:05,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:05,009 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:59:05,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:05,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:05,010 INFO L85 PathProgramCache]: Analyzing trace with hash 892957925, now seen corresponding path program 1 times [2025-01-10 00:59:05,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:05,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399889914] [2025-01-10 00:59:05,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:05,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:05,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:05,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:05,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399889914] [2025-01-10 00:59:05,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399889914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:05,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977099581] [2025-01-10 00:59:05,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:05,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:05,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:59:05,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 00:59:05,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:05,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:05,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:05,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:05,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:59:05,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:05,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:05,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977099581] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:05,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:05,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:59:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105434761] [2025-01-10 00:59:05,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:05,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:59:05,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:05,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:59:05,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:59:05,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2025-01-10 00:59:05,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 162 transitions, 357 flow. Second operand has 13 states, 13 states have (on average 89.15384615384616) internal successors, (1159), 13 states have internal predecessors, (1159), 0 states have call successors, (0), 0 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:59:05,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:05,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2025-01-10 00:59:05,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:05,689 INFO L124 PetriNetUnfolderBase]: 1062/3559 cut-off events. [2025-01-10 00:59:05,689 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-01-10 00:59:05,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5638 conditions, 3559 events. 1062/3559 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 31701 event pairs, 903 based on Foata normal form. 6/3083 useless extension candidates. Maximal degree in co-relation 5586. Up to 2011 conditions per place. [2025-01-10 00:59:05,701 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 71 selfloop transitions, 11 changer transitions 0/168 dead transitions. [2025-01-10 00:59:05,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 168 transitions, 557 flow [2025-01-10 00:59:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:59:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:59:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1144 transitions. [2025-01-10 00:59:05,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47906197654941374 [2025-01-10 00:59:05,706 INFO L175 Difference]: Start difference. First operand has 165 places, 162 transitions, 357 flow. Second operand 12 states and 1144 transitions. [2025-01-10 00:59:05,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 168 transitions, 557 flow [2025-01-10 00:59:05,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 168 transitions, 553 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:05,712 INFO L231 Difference]: Finished difference. Result has 180 places, 168 transitions, 437 flow [2025-01-10 00:59:05,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=437, PETRI_PLACES=180, PETRI_TRANSITIONS=168} [2025-01-10 00:59:05,714 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 21 predicate places. [2025-01-10 00:59:05,714 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 168 transitions, 437 flow [2025-01-10 00:59:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.15384615384616) internal successors, (1159), 13 states have internal predecessors, (1159), 0 states have call successors, (0), 0 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:59:05,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:05,715 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-01-10 00:59:05,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 00:59:05,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:05,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:05,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:05,917 INFO L85 PathProgramCache]: Analyzing trace with hash -839361947, now seen corresponding path program 2 times [2025-01-10 00:59:05,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:05,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714709862] [2025-01-10 00:59:05,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:05,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:05,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 00:59:05,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-01-10 00:59:05,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:05,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:06,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:59:06,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:06,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714709862] [2025-01-10 00:59:06,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714709862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:06,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:06,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:06,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11414232] [2025-01-10 00:59:06,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:06,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:06,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:06,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:06,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:06,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2025-01-10 00:59:06,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 168 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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:59:06,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:06,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2025-01-10 00:59:06,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:06,557 INFO L124 PetriNetUnfolderBase]: 1037/3328 cut-off events. [2025-01-10 00:59:06,558 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 00:59:06,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5392 conditions, 3328 events. 1037/3328 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 29550 event pairs, 0 based on Foata normal form. 1/2919 useless extension candidates. Maximal degree in co-relation 5316. Up to 1975 conditions per place. [2025-01-10 00:59:06,587 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 104 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2025-01-10 00:59:06,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 191 transitions, 695 flow [2025-01-10 00:59:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-01-10 00:59:06,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6013400335008375 [2025-01-10 00:59:06,588 INFO L175 Difference]: Start difference. First operand has 180 places, 168 transitions, 437 flow. Second operand 3 states and 359 transitions. [2025-01-10 00:59:06,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 191 transitions, 695 flow [2025-01-10 00:59:06,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 191 transitions, 647 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:59:06,596 INFO L231 Difference]: Finished difference. Result has 178 places, 168 transitions, 399 flow [2025-01-10 00:59:06,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=178, PETRI_TRANSITIONS=168} [2025-01-10 00:59:06,597 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, 19 predicate places. [2025-01-10 00:59:06,597 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 168 transitions, 399 flow [2025-01-10 00:59:06,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 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:59:06,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:06,597 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:06,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:59:06,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:06,598 INFO L85 PathProgramCache]: Analyzing trace with hash 229232818, now seen corresponding path program 1 times [2025-01-10 00:59:06,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:06,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8301554] [2025-01-10 00:59:06,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:06,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:06,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:59:06,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:59:06,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:06,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:06,800 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:59:06,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8301554] [2025-01-10 00:59:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8301554] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:06,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:06,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:59:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699583180] [2025-01-10 00:59:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:06,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:06,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:06,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:06,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:06,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 199 [2025-01-10 00:59:06,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 168 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:59:06,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:06,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 199 [2025-01-10 00:59:06,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:06,974 INFO L124 PetriNetUnfolderBase]: 72/276 cut-off events. [2025-01-10 00:59:06,975 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-01-10 00:59:06,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 276 events. 72/276 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1117 event pairs, 34 based on Foata normal form. 44/292 useless extension candidates. Maximal degree in co-relation 479. Up to 132 conditions per place. [2025-01-10 00:59:06,976 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 61 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-01-10 00:59:06,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 90 transitions, 362 flow [2025-01-10 00:59:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:06,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2025-01-10 00:59:06,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5012562814070352 [2025-01-10 00:59:06,978 INFO L175 Difference]: Start difference. First operand has 178 places, 168 transitions, 399 flow. Second operand 4 states and 399 transitions. [2025-01-10 00:59:06,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 90 transitions, 362 flow [2025-01-10 00:59:06,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 90 transitions, 356 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:59:06,980 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 186 flow [2025-01-10 00:59:06,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-01-10 00:59:06,980 INFO L279 CegarLoopForPetriNet]: 159 programPoint places, -79 predicate places. [2025-01-10 00:59:06,980 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 186 flow [2025-01-10 00:59:06,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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:59:06,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:06,981 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 00:59:06,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:59:06,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:06,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1483716212, now seen corresponding path program 1 times [2025-01-10 00:59:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33470487] [2025-01-10 00:59:06,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:06,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:59:07,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:59:07,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:07,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:07,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:07,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:59:07,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:59:07,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:07,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:07,050 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:07,051 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-01-10 00:59:07,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-01-10 00:59:07,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-01-10 00:59:07,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-01-10 00:59:07,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-01-10 00:59:07,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-01-10 00:59:07,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-01-10 00:59:07,054 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 50 remaining) [2025-01-10 00:59:07,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (25 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-01-10 00:59:07,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-01-10 00:59:07,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-01-10 00:59:07,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-01-10 00:59:07,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-01-10 00:59:07,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-01-10 00:59:07,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-01-10 00:59:07,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-01-10 00:59:07,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-01-10 00:59:07,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-01-10 00:59:07,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:59:07,060 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-01-10 00:59:07,063 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:07,063 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:59:07,097 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:59:07,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 262 transitions, 540 flow [2025-01-10 00:59:07,180 INFO L124 PetriNetUnfolderBase]: 113/534 cut-off events. [2025-01-10 00:59:07,184 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:59:07,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 534 events. 113/534 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3509 event pairs, 0 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 331. Up to 12 conditions per place. [2025-01-10 00:59:07,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 262 transitions, 540 flow [2025-01-10 00:59:07,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 262 transitions, 540 flow [2025-01-10 00:59:07,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:07,211 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;@4d5863c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:07,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-01-10 00:59:07,217 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:07,217 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:59:07,217 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:07,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:07,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:59:07,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:07,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:07,218 INFO L85 PathProgramCache]: Analyzing trace with hash 35802468, now seen corresponding path program 1 times [2025-01-10 00:59:07,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:07,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637046658] [2025-01-10 00:59:07,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:07,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:07,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:59:07,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:59:07,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:07,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:07,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:07,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637046658] [2025-01-10 00:59:07,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637046658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:07,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:07,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520926291] [2025-01-10 00:59:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:07,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:07,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:07,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:07,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 262 [2025-01-10 00:59:07,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 262 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:59:07,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:07,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 262 [2025-01-10 00:59:07,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:13,661 INFO L124 PetriNetUnfolderBase]: 46715/103379 cut-off events. [2025-01-10 00:59:13,662 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-01-10 00:59:13,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171109 conditions, 103379 events. 46715/103379 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 2946. Compared 1252801 event pairs, 41202 based on Foata normal form. 24383/114514 useless extension candidates. Maximal degree in co-relation 165251. Up to 67612 conditions per place. [2025-01-10 00:59:14,243 INFO L140 encePairwiseOnDemand]: 211/262 looper letters, 95 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2025-01-10 00:59:14,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 211 transitions, 632 flow [2025-01-10 00:59:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-01-10 00:59:14,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6208651399491094 [2025-01-10 00:59:14,366 INFO L175 Difference]: Start difference. First operand has 209 places, 262 transitions, 540 flow. Second operand 3 states and 488 transitions. [2025-01-10 00:59:14,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 211 transitions, 632 flow [2025-01-10 00:59:14,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 211 transitions, 632 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:14,369 INFO L231 Difference]: Finished difference. Result has 208 places, 211 transitions, 448 flow [2025-01-10 00:59:14,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=208, PETRI_TRANSITIONS=211} [2025-01-10 00:59:14,370 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, -1 predicate places. [2025-01-10 00:59:14,370 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 211 transitions, 448 flow [2025-01-10 00:59:14,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:59:14,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:14,370 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:14,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:59:14,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:14,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:14,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1109887182, now seen corresponding path program 1 times [2025-01-10 00:59:14,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:14,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641619664] [2025-01-10 00:59:14,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:14,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:14,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:14,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:14,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:14,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:14,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641619664] [2025-01-10 00:59:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641619664] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629824749] [2025-01-10 00:59:14,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:14,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:59:14,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 00:59:14,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:14,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:14,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:14,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:14,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:59:14,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:14,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:14,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629824749] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:14,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:14,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:59:14,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776190966] [2025-01-10 00:59:14,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:14,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:59:14,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:14,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:59:14,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:59:14,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 262 [2025-01-10 00:59:14,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 211 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 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:59:14,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:14,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 262 [2025-01-10 00:59:14,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:20,486 INFO L124 PetriNetUnfolderBase]: 46715/103382 cut-off events. [2025-01-10 00:59:20,486 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-01-10 00:59:20,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171125 conditions, 103382 events. 46715/103382 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 2946. Compared 1252596 event pairs, 41202 based on Foata normal form. 0/90134 useless extension candidates. Maximal degree in co-relation 171112. Up to 67612 conditions per place. [2025-01-10 00:59:21,080 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 95 selfloop transitions, 5 changer transitions 0/214 dead transitions. [2025-01-10 00:59:21,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 214 transitions, 660 flow [2025-01-10 00:59:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:59:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:59:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 787 transitions. [2025-01-10 00:59:21,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5006361323155216 [2025-01-10 00:59:21,083 INFO L175 Difference]: Start difference. First operand has 208 places, 211 transitions, 448 flow. Second operand 6 states and 787 transitions. [2025-01-10 00:59:21,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 214 transitions, 660 flow [2025-01-10 00:59:21,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 214 transitions, 656 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:21,087 INFO L231 Difference]: Finished difference. Result has 215 places, 214 transitions, 480 flow [2025-01-10 00:59:21,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=215, PETRI_TRANSITIONS=214} [2025-01-10 00:59:21,090 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 6 predicate places. [2025-01-10 00:59:21,090 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 214 transitions, 480 flow [2025-01-10 00:59:21,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 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:59:21,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:21,090 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:21,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 00:59:21,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:21,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:21,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:21,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2001393636, now seen corresponding path program 2 times [2025-01-10 00:59:21,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:21,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348929120] [2025-01-10 00:59:21,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:21,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 00:59:21,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 8 statements. [2025-01-10 00:59:21,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:21,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-10 00:59:21,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:21,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348929120] [2025-01-10 00:59:21,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348929120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:21,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:21,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:21,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926895537] [2025-01-10 00:59:21,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:21,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:21,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:21,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 262 [2025-01-10 00:59:21,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 214 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:59:21,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:21,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 262 [2025-01-10 00:59:21,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:27,338 INFO L124 PetriNetUnfolderBase]: 48766/106540 cut-off events. [2025-01-10 00:59:27,338 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2025-01-10 00:59:27,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177350 conditions, 106540 events. 48766/106540 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 2999. Compared 1282782 event pairs, 41181 based on Foata normal form. 0/93611 useless extension candidates. Maximal degree in co-relation 177315. Up to 67531 conditions per place. [2025-01-10 00:59:28,185 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 144 selfloop transitions, 2 changer transitions 0/256 dead transitions. [2025-01-10 00:59:28,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 256 transitions, 856 flow [2025-01-10 00:59:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 474 transitions. [2025-01-10 00:59:28,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6030534351145038 [2025-01-10 00:59:28,187 INFO L175 Difference]: Start difference. First operand has 215 places, 214 transitions, 480 flow. Second operand 3 states and 474 transitions. [2025-01-10 00:59:28,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 256 transitions, 856 flow [2025-01-10 00:59:28,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 256 transitions, 842 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:28,191 INFO L231 Difference]: Finished difference. Result has 214 places, 212 transitions, 466 flow [2025-01-10 00:59:28,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=214, PETRI_TRANSITIONS=212} [2025-01-10 00:59:28,191 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 5 predicate places. [2025-01-10 00:59:28,191 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 212 transitions, 466 flow [2025-01-10 00:59:28,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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:59:28,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:28,192 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:28,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:59:28,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:28,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2001393637, now seen corresponding path program 1 times [2025-01-10 00:59:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327329641] [2025-01-10 00:59:28,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:28,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:28,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:28,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327329641] [2025-01-10 00:59:28,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327329641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:28,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245957811] [2025-01-10 00:59:28,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:28,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:28,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:28,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:59:28,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 00:59:28,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:28,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:28,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:28,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:28,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:59:28,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:28,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:28,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245957811] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:28,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:28,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:59:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347150807] [2025-01-10 00:59:28,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:28,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:59:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:28,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:59:28,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:59:28,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 262 [2025-01-10 00:59:28,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 212 transitions, 466 flow. Second operand has 13 states, 13 states have (on average 115.15384615384616) internal successors, (1497), 13 states have internal predecessors, (1497), 0 states have call successors, (0), 0 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:59:28,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:28,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 262 [2025-01-10 00:59:28,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:33,943 INFO L124 PetriNetUnfolderBase]: 46715/103062 cut-off events. [2025-01-10 00:59:33,944 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2025-01-10 00:59:34,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171360 conditions, 103062 events. 46715/103062 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 2933. Compared 1245228 event pairs, 41202 based on Foata normal form. 6/90147 useless extension candidates. Maximal degree in co-relation 171307. Up to 67612 conditions per place. [2025-01-10 00:59:34,548 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 95 selfloop transitions, 11 changer transitions 0/218 dead transitions. [2025-01-10 00:59:34,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 218 transitions, 714 flow [2025-01-10 00:59:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:59:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:59:34,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1480 transitions. [2025-01-10 00:59:34,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4707379134860051 [2025-01-10 00:59:34,551 INFO L175 Difference]: Start difference. First operand has 214 places, 212 transitions, 466 flow. Second operand 12 states and 1480 transitions. [2025-01-10 00:59:34,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 218 transitions, 714 flow [2025-01-10 00:59:34,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 218 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:34,581 INFO L231 Difference]: Finished difference. Result has 229 places, 218 transitions, 546 flow [2025-01-10 00:59:34,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=546, PETRI_PLACES=229, PETRI_TRANSITIONS=218} [2025-01-10 00:59:34,581 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 20 predicate places. [2025-01-10 00:59:34,581 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 218 transitions, 546 flow [2025-01-10 00:59:34,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.15384615384616) internal successors, (1497), 13 states have internal predecessors, (1497), 0 states have call successors, (0), 0 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:59:34,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:34,582 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-01-10 00:59:34,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 00:59:34,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 00:59:34,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:34,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:34,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1446006693, now seen corresponding path program 2 times [2025-01-10 00:59:34,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:34,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634603483] [2025-01-10 00:59:34,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:34,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:34,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 00:59:34,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-01-10 00:59:34,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:34,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:59:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:34,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634603483] [2025-01-10 00:59:34,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634603483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:34,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:34,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578088649] [2025-01-10 00:59:34,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:34,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:34,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:34,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:34,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:34,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 262 [2025-01-10 00:59:34,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 218 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:59:34,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:34,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 262 [2025-01-10 00:59:34,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:41,166 INFO L124 PetriNetUnfolderBase]: 47749/106047 cut-off events. [2025-01-10 00:59:41,167 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2025-01-10 00:59:41,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175158 conditions, 106047 events. 47749/106047 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 2983. Compared 1289943 event pairs, 37990 based on Foata normal form. 1/92729 useless extension candidates. Maximal degree in co-relation 175081. Up to 68910 conditions per place. [2025-01-10 00:59:42,006 INFO L140 encePairwiseOnDemand]: 258/262 looper letters, 129 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2025-01-10 00:59:42,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 242 transitions, 856 flow [2025-01-10 00:59:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2025-01-10 00:59:42,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877862595419847 [2025-01-10 00:59:42,007 INFO L175 Difference]: Start difference. First operand has 229 places, 218 transitions, 546 flow. Second operand 3 states and 462 transitions. [2025-01-10 00:59:42,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 242 transitions, 856 flow [2025-01-10 00:59:42,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 242 transitions, 808 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:59:42,012 INFO L231 Difference]: Finished difference. Result has 227 places, 219 transitions, 512 flow [2025-01-10 00:59:42,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=227, PETRI_TRANSITIONS=219} [2025-01-10 00:59:42,017 INFO L279 CegarLoopForPetriNet]: 209 programPoint places, 18 predicate places. [2025-01-10 00:59:42,017 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 219 transitions, 512 flow [2025-01-10 00:59:42,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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:59:42,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:42,017 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:42,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:59:42,017 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:42,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:42,022 INFO L85 PathProgramCache]: Analyzing trace with hash 586936853, now seen corresponding path program 1 times [2025-01-10 00:59:42,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:42,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546398050] [2025-01-10 00:59:42,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:42,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:42,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:59:42,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:59:42,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:42,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-10 00:59:42,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:42,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546398050] [2025-01-10 00:59:42,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546398050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:42,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:42,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:59:42,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317902771] [2025-01-10 00:59:42,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:42,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:42,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:42,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:42,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 262 [2025-01-10 00:59:42,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 219 transitions, 512 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:59:42,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:42,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 262 [2025-01-10 00:59:42,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand