./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.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_70-funloop_racefree.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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:57,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:57,850 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:57,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:57,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:57,867 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:57,868 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:57,868 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:57,868 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:57,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:57,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:57,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:57,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:57,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:57,869 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:57,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:57,869 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:57,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:57,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:57,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:57,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:57,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:57,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:57,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:57,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:57,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:57,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:57,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:57,872 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2025-01-10 00:58:58,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:58,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:58,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:58,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:58,073 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:58,074 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_70-funloop_racefree.i [2025-01-10 00:58:59,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45105325d/c3503cc727944e8b8e069be2565dd7c0/FLAG4fa91102d [2025-01-10 00:58:59,644 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:58:59,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2025-01-10 00:58:59,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45105325d/c3503cc727944e8b8e069be2565dd7c0/FLAG4fa91102d [2025-01-10 00:58:59,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45105325d/c3503cc727944e8b8e069be2565dd7c0 [2025-01-10 00:58:59,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:58:59,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:58:59,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:58:59,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:58:59,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:58:59,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:59" (1/1) ... [2025-01-10 00:58:59,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7598cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:58:59, skipping insertion in model container [2025-01-10 00:58:59,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:58:59" (1/1) ... [2025-01-10 00:58:59,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:59:00,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:00,264 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:59:00,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:00,349 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:59:00,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:00 WrapperNode [2025-01-10 00:59:00,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:00,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:00,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:59:00,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:59:00,359 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:00" (1/1) ... [2025-01-10 00:59:00,378 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:00" (1/1) ... [2025-01-10 00:59:00,398 INFO L138 Inliner]: procedures = 272, calls = 96, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 256 [2025-01-10 00:59:00,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:00,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:59:00,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:59:00,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:59:00,411 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:00" (1/1) ... [2025-01-10 00:59:00,411 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:00" (1/1) ... [2025-01-10 00:59:00,416 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:00" (1/1) ... [2025-01-10 00:59:00,433 INFO L175 MemorySlicer]: Split 79 memory accesses to 4 slices as follows [2, 2, 5, 70]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 0, 5, 60]. The 5 writes are split as follows [0, 1, 0, 4]. [2025-01-10 00:59:00,437 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:00" (1/1) ... [2025-01-10 00:59:00,437 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:00" (1/1) ... [2025-01-10 00:59:00,448 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:00" (1/1) ... [2025-01-10 00:59:00,452 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:00" (1/1) ... [2025-01-10 00:59:00,455 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:00" (1/1) ... [2025-01-10 00:59:00,458 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:00" (1/1) ... [2025-01-10 00:59:00,459 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:00" (1/1) ... [2025-01-10 00:59:00,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:59:00,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:59:00,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:59:00,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:59:00,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:00" (1/1) ... [2025-01-10 00:59:00,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:00,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:00,495 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:00,500 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:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:59:00,517 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:59:00,517 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:59:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:59:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:59:00,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:59:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:59:00,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:59:00,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:59:00,521 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:00,645 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:59:00,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:59:00,988 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:59:00,989 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:59:01,333 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:59:01,333 INFO L312 CfgBuilder]: Removed 10 assume(true) statements. [2025-01-10 00:59:01,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:01 BoogieIcfgContainer [2025-01-10 00:59:01,335 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:59:01,336 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:59:01,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:59:01,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:59:01,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:58:59" (1/3) ... [2025-01-10 00:59:01,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250eff57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:01, skipping insertion in model container [2025-01-10 00:59:01,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:00" (2/3) ... [2025-01-10 00:59:01,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250eff57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:01, skipping insertion in model container [2025-01-10 00:59:01,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:01" (3/3) ... [2025-01-10 00:59:01,342 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2025-01-10 00:59:01,351 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:59:01,353 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_70-funloop_racefree.i that has 2 procedures, 111 locations, 1 initial locations, 15 loop locations, and 27 error locations. [2025-01-10 00:59:01,353 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:59:01,406 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:59:01,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 141 transitions, 289 flow [2025-01-10 00:59:01,492 INFO L124 PetriNetUnfolderBase]: 44/213 cut-off events. [2025-01-10 00:59:01,494 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:59:01,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 213 events. 44/213 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1046 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 134. Up to 8 conditions per place. [2025-01-10 00:59:01,503 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 141 transitions, 289 flow [2025-01-10 00:59:01,506 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 141 transitions, 289 flow [2025-01-10 00:59:01,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:01,524 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;@37105a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:01,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-01-10 00:59:01,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:01,529 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:59:01,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:01,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:01,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:59:01,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-10 00:59:01,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash 21861837, now seen corresponding path program 1 times [2025-01-10 00:59:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599652715] [2025-01-10 00:59:01,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:01,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:01,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:59:01,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:59:01,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:01,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:01,753 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:01,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:01,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599652715] [2025-01-10 00:59:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599652715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:01,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:01,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491911941] [2025-01-10 00:59:01,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:01,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:01,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:01,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 141 [2025-01-10 00:59:01,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 141 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:01,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:01,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 141 [2025-01-10 00:59:01,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:02,075 INFO L124 PetriNetUnfolderBase]: 625/2062 cut-off events. [2025-01-10 00:59:02,075 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:59:02,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3255 conditions, 2062 events. 625/2062 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15801 event pairs, 525 based on Foata normal form. 394/2149 useless extension candidates. Maximal degree in co-relation 3150. Up to 1187 conditions per place. [2025-01-10 00:59:02,090 INFO L140 encePairwiseOnDemand]: 114/141 looper letters, 53 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-01-10 00:59:02,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 116 transitions, 349 flow [2025-01-10 00:59:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-01-10 00:59:02,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6217494089834515 [2025-01-10 00:59:02,100 INFO L175 Difference]: Start difference. First operand has 114 places, 141 transitions, 289 flow. Second operand 3 states and 263 transitions. [2025-01-10 00:59:02,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 116 transitions, 349 flow [2025-01-10 00:59:02,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 349 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:02,106 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 249 flow [2025-01-10 00:59:02,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-01-10 00:59:02,109 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 1 predicate places. [2025-01-10 00:59:02,110 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 249 flow [2025-01-10 00:59:02,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:02,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:02,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:02,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:59:02,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-10 00:59:02,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:02,111 INFO L85 PathProgramCache]: Analyzing trace with hash 677651120, now seen corresponding path program 1 times [2025-01-10 00:59:02,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:02,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688203685] [2025-01-10 00:59:02,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:02,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:02,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:02,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:02,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:02,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:02,195 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:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688203685] [2025-01-10 00:59:02,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688203685] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:02,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129764693] [2025-01-10 00:59:02,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:02,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:02,204 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:02,205 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:02,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:02,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:02,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:02,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:02,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:59:02,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:02,307 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:02,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:02,322 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:02,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129764693] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:02,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:02,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:59:02,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113948067] [2025-01-10 00:59:02,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:02,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:59:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:02,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:59:02,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:59:02,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 141 [2025-01-10 00:59:02,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 62.285714285714285) internal successors, (436), 7 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:02,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:02,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 141 [2025-01-10 00:59:02,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:02,613 INFO L124 PetriNetUnfolderBase]: 625/2065 cut-off events. [2025-01-10 00:59:02,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 00:59:02,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 2065 events. 625/2065 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15822 event pairs, 525 based on Foata normal form. 0/1758 useless extension candidates. Maximal degree in co-relation 3259. Up to 1187 conditions per place. [2025-01-10 00:59:02,625 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 53 selfloop transitions, 5 changer transitions 0/119 dead transitions. [2025-01-10 00:59:02,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 119 transitions, 377 flow [2025-01-10 00:59:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:59:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:59:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2025-01-10 00:59:02,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5047281323877069 [2025-01-10 00:59:02,627 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 249 flow. Second operand 6 states and 427 transitions. [2025-01-10 00:59:02,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 119 transitions, 377 flow [2025-01-10 00:59:02,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 119 transitions, 373 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:02,630 INFO L231 Difference]: Finished difference. Result has 122 places, 119 transitions, 281 flow [2025-01-10 00:59:02,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=122, PETRI_TRANSITIONS=119} [2025-01-10 00:59:02,631 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 8 predicate places. [2025-01-10 00:59:02,631 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 119 transitions, 281 flow [2025-01-10 00:59:02,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 62.285714285714285) internal successors, (436), 7 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:02,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:02,631 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:02,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 00:59:02,832 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:02,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-10 00:59:02,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1492858509, now seen corresponding path program 2 times [2025-01-10 00:59:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:02,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983423185] [2025-01-10 00:59:02,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:02,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:02,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 00:59:02,871 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:02,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:02,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:02,940 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:02,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:02,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983423185] [2025-01-10 00:59:02,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983423185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:02,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:02,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855348157] [2025-01-10 00:59:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:02,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:02,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:02,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:02,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:02,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 141 [2025-01-10 00:59:02,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 119 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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:02,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:02,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 141 [2025-01-10 00:59:02,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:03,260 INFO L124 PetriNetUnfolderBase]: 669/2168 cut-off events. [2025-01-10 00:59:03,261 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 00:59:03,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 2168 events. 669/2168 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 16894 event pairs, 525 based on Foata normal form. 0/1864 useless extension candidates. Maximal degree in co-relation 3443. Up to 1184 conditions per place. [2025-01-10 00:59:03,272 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 80 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2025-01-10 00:59:03,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 139 transitions, 485 flow [2025-01-10 00:59:03,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-01-10 00:59:03,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5933806146572104 [2025-01-10 00:59:03,275 INFO L175 Difference]: Start difference. First operand has 122 places, 119 transitions, 281 flow. Second operand 3 states and 251 transitions. [2025-01-10 00:59:03,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 139 transitions, 485 flow [2025-01-10 00:59:03,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 139 transitions, 471 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:03,281 INFO L231 Difference]: Finished difference. Result has 121 places, 117 transitions, 267 flow [2025-01-10 00:59:03,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=121, PETRI_TRANSITIONS=117} [2025-01-10 00:59:03,283 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 7 predicate places. [2025-01-10 00:59:03,283 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 117 transitions, 267 flow [2025-01-10 00:59:03,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 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,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:03,283 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:59:03,283 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-10 00:59:03,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1492858510, now seen corresponding path program 1 times [2025-01-10 00:59:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:03,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121333320] [2025-01-10 00:59:03,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:03,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:03,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:03,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:03,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:03,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,433 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:03,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:03,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121333320] [2025-01-10 00:59:03,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121333320] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:03,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601215058] [2025-01-10 00:59:03,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:03,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:03,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:03,436 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:03,437 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:03,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:03,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:03,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:03,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:59:03,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:03,526 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:03,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:03,581 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:03,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601215058] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:03,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:03,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:59:03,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287485856] [2025-01-10 00:59:03,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:03,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:59:03,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:03,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:59:03,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:59:03,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 141 [2025-01-10 00:59:03,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 117 transitions, 267 flow. Second operand has 13 states, 13 states have (on average 62.15384615384615) internal successors, (808), 13 states have internal predecessors, (808), 0 states have call successors, (0), 0 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,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:03,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 141 [2025-01-10 00:59:03,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:03,883 INFO L124 PetriNetUnfolderBase]: 625/2067 cut-off events. [2025-01-10 00:59:03,883 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-01-10 00:59:03,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 2067 events. 625/2067 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 15763 event pairs, 525 based on Foata normal form. 6/1771 useless extension candidates. Maximal degree in co-relation 3270. Up to 1187 conditions per place. [2025-01-10 00:59:03,893 INFO L140 encePairwiseOnDemand]: 138/141 looper letters, 53 selfloop transitions, 11 changer transitions 0/123 dead transitions. [2025-01-10 00:59:03,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 123 transitions, 431 flow [2025-01-10 00:59:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:59:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:59:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 802 transitions. [2025-01-10 00:59:03,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4739952718676123 [2025-01-10 00:59:03,897 INFO L175 Difference]: Start difference. First operand has 121 places, 117 transitions, 267 flow. Second operand 12 states and 802 transitions. [2025-01-10 00:59:03,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 123 transitions, 431 flow [2025-01-10 00:59:03,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 123 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:03,902 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 347 flow [2025-01-10 00:59:03,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=347, PETRI_PLACES=136, PETRI_TRANSITIONS=123} [2025-01-10 00:59:03,905 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2025-01-10 00:59:03,905 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 347 flow [2025-01-10 00:59:03,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 62.15384615384615) internal successors, (808), 13 states have internal predecessors, (808), 0 states have call successors, (0), 0 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,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:03,906 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-01-10 00:59:03,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 00:59:04,106 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:04,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-10 00:59:04,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:04,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1165380690, now seen corresponding path program 2 times [2025-01-10 00:59:04,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:04,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941990393] [2025-01-10 00:59:04,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:04,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:04,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 00:59:04,131 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:04,132 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:04,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:04,217 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:04,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:04,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941990393] [2025-01-10 00:59:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941990393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:04,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:04,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:04,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406526522] [2025-01-10 00:59:04,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:04,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:04,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:04,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:04,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:04,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 141 [2025-01-10 00:59:04,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:04,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:04,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 141 [2025-01-10 00:59:04,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,541 INFO L124 PetriNetUnfolderBase]: 619/1942 cut-off events. [2025-01-10 00:59:04,542 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 00:59:04,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3214 conditions, 1942 events. 619/1942 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 15059 event pairs, 0 based on Foata normal form. 1/1678 useless extension candidates. Maximal degree in co-relation 3138. Up to 1183 conditions per place. [2025-01-10 00:59:04,552 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 86 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-01-10 00:59:04,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 146 transitions, 569 flow [2025-01-10 00:59:04,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:04,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2025-01-10 00:59:04,554 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6146572104018913 [2025-01-10 00:59:04,554 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 347 flow. Second operand 3 states and 260 transitions. [2025-01-10 00:59:04,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 146 transitions, 569 flow [2025-01-10 00:59:04,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 146 transitions, 521 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:59:04,563 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 309 flow [2025-01-10 00:59:04,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2025-01-10 00:59:04,565 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, 20 predicate places. [2025-01-10 00:59:04,567 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 309 flow [2025-01-10 00:59:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:04,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,567 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:04,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:59:04,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-10 00:59:04,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:04,568 INFO L85 PathProgramCache]: Analyzing trace with hash 863786546, now seen corresponding path program 1 times [2025-01-10 00:59:04,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:04,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133710430] [2025-01-10 00:59:04,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:04,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:04,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:59:04,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:59:04,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:04,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:04,810 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:04,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:04,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133710430] [2025-01-10 00:59:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133710430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:04,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:04,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:59:04,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723866473] [2025-01-10 00:59:04,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:04,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:04,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:04,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2025-01-10 00:59:04,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:04,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:04,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2025-01-10 00:59:04,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,991 INFO L124 PetriNetUnfolderBase]: 69/218 cut-off events. [2025-01-10 00:59:04,992 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-01-10 00:59:04,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 218 events. 69/218 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 852 event pairs, 0 based on Foata normal form. 44/246 useless extension candidates. Maximal degree in co-relation 421. Up to 132 conditions per place. [2025-01-10 00:59:04,993 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 61 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-01-10 00:59:04,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 90 transitions, 362 flow [2025-01-10 00:59:04,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:04,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:04,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2025-01-10 00:59:04,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5159574468085106 [2025-01-10 00:59:04,995 INFO L175 Difference]: Start difference. First operand has 134 places, 123 transitions, 309 flow. Second operand 4 states and 291 transitions. [2025-01-10 00:59:04,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 90 transitions, 362 flow [2025-01-10 00:59:04,997 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:04,998 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 186 flow [2025-01-10 00:59:04,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, 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:04,999 INFO L279 CegarLoopForPetriNet]: 114 programPoint places, -34 predicate places. [2025-01-10 00:59:04,999 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 186 flow [2025-01-10 00:59:04,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.8) internal successors, (304), 5 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:04,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,999 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 00:59:04,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:59:04,999 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2025-01-10 00:59:05,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1007579937, now seen corresponding path program 1 times [2025-01-10 00:59:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:05,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817676421] [2025-01-10 00:59:05,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:05,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:59:05,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:59:05,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:05,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:05,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:59:05,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:59:05,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:05,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:05,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:05,084 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:05,085 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (33 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 39 remaining) [2025-01-10 00:59:05,090 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (22 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 39 remaining) [2025-01-10 00:59:05,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (11 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 39 remaining) [2025-01-10 00:59:05,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 39 remaining) [2025-01-10 00:59:05,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 39 remaining) [2025-01-10 00:59:05,095 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 39 remaining) [2025-01-10 00:59:05,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 39 remaining) [2025-01-10 00:59:05,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 39 remaining) [2025-01-10 00:59:05,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 39 remaining) [2025-01-10 00:59:05,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 39 remaining) [2025-01-10 00:59:05,096 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 39 remaining) [2025-01-10 00:59:05,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:59:05,096 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-01-10 00:59:05,098 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:05,098 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:59:05,160 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:59:05,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 204 transitions, 424 flow [2025-01-10 00:59:05,200 INFO L124 PetriNetUnfolderBase]: 74/360 cut-off events. [2025-01-10 00:59:05,200 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:59:05,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 360 events. 74/360 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2101 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 215. Up to 12 conditions per place. [2025-01-10 00:59:05,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 204 transitions, 424 flow [2025-01-10 00:59:05,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 204 transitions, 424 flow [2025-01-10 00:59:05,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:05,216 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;@37105a92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:05,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 00:59:05,217 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:05,217 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:59:05,218 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:05,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:05,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:59:05,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:05,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 28141773, now seen corresponding path program 1 times [2025-01-10 00:59:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:05,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722736853] [2025-01-10 00:59:05,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:05,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:59:05,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:59:05,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:05,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:05,265 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:05,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:05,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722736853] [2025-01-10 00:59:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722736853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163920930] [2025-01-10 00:59:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:05,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:05,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:05,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:05,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2025-01-10 00:59:05,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 204 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:05,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2025-01-10 00:59:05,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:09,477 INFO L124 PetriNetUnfolderBase]: 27581/60837 cut-off events. [2025-01-10 00:59:09,478 INFO L125 PetriNetUnfolderBase]: For 200/205 co-relation queries the response was YES. [2025-01-10 00:59:09,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100897 conditions, 60837 events. 27581/60837 cut-off events. For 200/205 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 679691 event pairs, 24192 based on Foata normal form. 13675/66308 useless extension candidates. Maximal degree in co-relation 93084. Up to 39942 conditions per place. [2025-01-10 00:59:09,867 INFO L140 encePairwiseOnDemand]: 165/204 looper letters, 77 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-01-10 00:59:09,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 166 transitions, 506 flow [2025-01-10 00:59:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2025-01-10 00:59:09,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6160130718954249 [2025-01-10 00:59:09,870 INFO L175 Difference]: Start difference. First operand has 164 places, 204 transitions, 424 flow. Second operand 3 states and 377 transitions. [2025-01-10 00:59:09,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 166 transitions, 506 flow [2025-01-10 00:59:09,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 166 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:09,874 INFO L231 Difference]: Finished difference. Result has 164 places, 166 transitions, 358 flow [2025-01-10 00:59:09,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=164, PETRI_TRANSITIONS=166} [2025-01-10 00:59:09,876 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 0 predicate places. [2025-01-10 00:59:09,876 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 166 transitions, 358 flow [2025-01-10 00:59:09,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 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:09,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:09,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:09,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:59:09,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:09,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:09,878 INFO L85 PathProgramCache]: Analyzing trace with hash 872329340, now seen corresponding path program 1 times [2025-01-10 00:59:09,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:09,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324694563] [2025-01-10 00:59:09,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:09,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:09,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:09,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:09,933 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:09,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324694563] [2025-01-10 00:59:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324694563] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175173869] [2025-01-10 00:59:09,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:09,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:09,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:09,936 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:09,939 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:10,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:10,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:10,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:10,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:10,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:59:10,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:10,050 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:10,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:10,066 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:10,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175173869] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:10,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:10,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:59:10,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68680190] [2025-01-10 00:59:10,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:10,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:59:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:10,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:59:10,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:59:10,069 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2025-01-10 00:59:10,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 166 transitions, 358 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 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:10,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:10,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2025-01-10 00:59:10,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:13,839 INFO L124 PetriNetUnfolderBase]: 27581/60840 cut-off events. [2025-01-10 00:59:13,840 INFO L125 PetriNetUnfolderBase]: For 200/205 co-relation queries the response was YES. [2025-01-10 00:59:13,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100913 conditions, 60840 events. 27581/60840 cut-off events. For 200/205 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 679566 event pairs, 24192 based on Foata normal form. 0/52636 useless extension candidates. Maximal degree in co-relation 100900. Up to 39942 conditions per place. [2025-01-10 00:59:14,217 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 77 selfloop transitions, 5 changer transitions 0/169 dead transitions. [2025-01-10 00:59:14,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 169 transitions, 534 flow [2025-01-10 00:59:14,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:59:14,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:59:14,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions. [2025-01-10 00:59:14,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4959150326797386 [2025-01-10 00:59:14,219 INFO L175 Difference]: Start difference. First operand has 164 places, 166 transitions, 358 flow. Second operand 6 states and 607 transitions. [2025-01-10 00:59:14,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 169 transitions, 534 flow [2025-01-10 00:59:14,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 169 transitions, 530 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:14,222 INFO L231 Difference]: Finished difference. Result has 171 places, 169 transitions, 390 flow [2025-01-10 00:59:14,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=390, PETRI_PLACES=171, PETRI_TRANSITIONS=169} [2025-01-10 00:59:14,223 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 7 predicate places. [2025-01-10 00:59:14,223 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 169 transitions, 390 flow [2025-01-10 00:59:14,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 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,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:14,223 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:14,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 00:59:14,428 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:14,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:14,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1348903795, now seen corresponding path program 2 times [2025-01-10 00:59:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:14,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513030482] [2025-01-10 00:59:14,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:14,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:14,439 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 00:59:14,442 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:14,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:14,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:14,465 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:14,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:14,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513030482] [2025-01-10 00:59:14,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513030482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:14,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:14,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:14,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799666239] [2025-01-10 00:59:14,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:14,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:14,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:14,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:14,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:14,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 204 [2025-01-10 00:59:14,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 169 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:14,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 204 [2025-01-10 00:59:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:18,217 INFO L124 PetriNetUnfolderBase]: 29604/64368 cut-off events. [2025-01-10 00:59:18,217 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-01-10 00:59:18,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107514 conditions, 64368 events. 29604/64368 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 1771. Compared 719473 event pairs, 24171 based on Foata normal form. 0/55924 useless extension candidates. Maximal degree in co-relation 107479. Up to 39895 conditions per place. [2025-01-10 00:59:18,612 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 126 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2025-01-10 00:59:18,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 211 transitions, 730 flow [2025-01-10 00:59:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:18,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2025-01-10 00:59:18,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6127450980392157 [2025-01-10 00:59:18,614 INFO L175 Difference]: Start difference. First operand has 171 places, 169 transitions, 390 flow. Second operand 3 states and 375 transitions. [2025-01-10 00:59:18,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 211 transitions, 730 flow [2025-01-10 00:59:18,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 211 transitions, 716 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:18,619 INFO L231 Difference]: Finished difference. Result has 170 places, 167 transitions, 376 flow [2025-01-10 00:59:18,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=170, PETRI_TRANSITIONS=167} [2025-01-10 00:59:18,620 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 6 predicate places. [2025-01-10 00:59:18,620 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 167 transitions, 376 flow [2025-01-10 00:59:18,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 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:18,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:18,621 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:18,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:59:18,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:18,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:18,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1348903794, now seen corresponding path program 1 times [2025-01-10 00:59:18,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:18,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543270287] [2025-01-10 00:59:18,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:18,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:18,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:18,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:18,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:18,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:18,887 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:18,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:18,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543270287] [2025-01-10 00:59:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543270287] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:18,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26106153] [2025-01-10 00:59:18,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:18,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:18,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:18,895 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:18,896 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:18,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:18,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:18,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:18,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:18,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:59:18,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:18,976 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:18,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:19,022 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:19,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26106153] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:19,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:19,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:59:19,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815541410] [2025-01-10 00:59:19,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:19,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:59:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:19,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:59:19,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:59:19,024 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2025-01-10 00:59:19,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 167 transitions, 376 flow. Second operand has 13 states, 13 states have (on average 88.15384615384616) internal successors, (1146), 13 states have internal predecessors, (1146), 0 states have call successors, (0), 0 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:19,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:19,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2025-01-10 00:59:19,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:22,888 INFO L124 PetriNetUnfolderBase]: 27581/60830 cut-off events. [2025-01-10 00:59:22,889 INFO L125 PetriNetUnfolderBase]: For 765/770 co-relation queries the response was YES. [2025-01-10 00:59:23,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101458 conditions, 60830 events. 27581/60830 cut-off events. For 765/770 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 679450 event pairs, 24192 based on Foata normal form. 6/52649 useless extension candidates. Maximal degree in co-relation 101405. Up to 39942 conditions per place. [2025-01-10 00:59:23,221 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 77 selfloop transitions, 11 changer transitions 0/173 dead transitions. [2025-01-10 00:59:23,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 173 transitions, 588 flow [2025-01-10 00:59:23,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:59:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:59:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1138 transitions. [2025-01-10 00:59:23,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46486928104575165 [2025-01-10 00:59:23,225 INFO L175 Difference]: Start difference. First operand has 170 places, 167 transitions, 376 flow. Second operand 12 states and 1138 transitions. [2025-01-10 00:59:23,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 173 transitions, 588 flow [2025-01-10 00:59:23,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 173 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:23,232 INFO L231 Difference]: Finished difference. Result has 185 places, 173 transitions, 456 flow [2025-01-10 00:59:23,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=456, PETRI_PLACES=185, PETRI_TRANSITIONS=173} [2025-01-10 00:59:23,233 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 21 predicate places. [2025-01-10 00:59:23,233 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 173 transitions, 456 flow [2025-01-10 00:59:23,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.15384615384616) internal successors, (1146), 13 states have internal predecessors, (1146), 0 states have call successors, (0), 0 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:23,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:23,234 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-01-10 00:59:23,244 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:23,435 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:23,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1221949906, now seen corresponding path program 2 times [2025-01-10 00:59:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945732157] [2025-01-10 00:59:23,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:23,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 00:59:23,451 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:23,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:23,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:23,508 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:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945732157] [2025-01-10 00:59:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945732157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:23,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:23,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594257633] [2025-01-10 00:59:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:23,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:23,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:23,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:23,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:23,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2025-01-10 00:59:23,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 173 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:23,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:23,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2025-01-10 00:59:23,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:27,630 INFO L124 PetriNetUnfolderBase]: 27992/60764 cut-off events. [2025-01-10 00:59:27,631 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2025-01-10 00:59:27,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101859 conditions, 60764 events. 27992/60764 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 678000 event pairs, 12096 based on Foata normal form. 1/52719 useless extension candidates. Maximal degree in co-relation 101782. Up to 40894 conditions per place. [2025-01-10 00:59:28,014 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 111 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2025-01-10 00:59:28,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 197 transitions, 730 flow [2025-01-10 00:59:28,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-01-10 00:59:28,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5931372549019608 [2025-01-10 00:59:28,016 INFO L175 Difference]: Start difference. First operand has 185 places, 173 transitions, 456 flow. Second operand 3 states and 363 transitions. [2025-01-10 00:59:28,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 197 transitions, 730 flow [2025-01-10 00:59:28,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 197 transitions, 682 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:59:28,019 INFO L231 Difference]: Finished difference. Result has 183 places, 174 transitions, 422 flow [2025-01-10 00:59:28,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=183, PETRI_TRANSITIONS=174} [2025-01-10 00:59:28,020 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 19 predicate places. [2025-01-10 00:59:28,020 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 174 transitions, 422 flow [2025-01-10 00:59:28,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 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,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:28,020 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:28,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 00:59:28,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:28,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:28,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1995142741, now seen corresponding path program 1 times [2025-01-10 00:59:28,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:28,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200551687] [2025-01-10 00:59:28,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:28,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:59:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:59:28,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:28,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:28,136 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:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200551687] [2025-01-10 00:59:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200551687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:28,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:28,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 00:59:28,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137333191] [2025-01-10 00:59:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:28,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:59:28,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:28,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:59:28,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:59:28,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 204 [2025-01-10 00:59:28,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 174 transitions, 422 flow. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 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,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:28,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 204 [2025-01-10 00:59:28,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:31,977 INFO L124 PetriNetUnfolderBase]: 27704/57978 cut-off events. [2025-01-10 00:59:31,977 INFO L125 PetriNetUnfolderBase]: For 1290/1290 co-relation queries the response was YES. [2025-01-10 00:59:32,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100580 conditions, 57978 events. 27704/57978 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 1683. Compared 636504 event pairs, 391 based on Foata normal form. 22/51000 useless extension candidates. Maximal degree in co-relation 100526. Up to 39816 conditions per place. [2025-01-10 00:59:32,371 INFO L140 encePairwiseOnDemand]: 200/204 looper letters, 155 selfloop transitions, 4 changer transitions 0/243 dead transitions. [2025-01-10 00:59:32,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 243 transitions, 880 flow [2025-01-10 00:59:32,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2025-01-10 00:59:32,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6053921568627451 [2025-01-10 00:59:32,373 INFO L175 Difference]: Start difference. First operand has 183 places, 174 transitions, 422 flow. Second operand 4 states and 494 transitions. [2025-01-10 00:59:32,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 243 transitions, 880 flow [2025-01-10 00:59:32,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 243 transitions, 878 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:32,387 INFO L231 Difference]: Finished difference. Result has 186 places, 175 transitions, 439 flow [2025-01-10 00:59:32,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=439, PETRI_PLACES=186, PETRI_TRANSITIONS=175} [2025-01-10 00:59:32,388 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 22 predicate places. [2025-01-10 00:59:32,388 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 175 transitions, 439 flow [2025-01-10 00:59:32,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 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:32,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:32,388 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:32,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 00:59:32,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:32,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1776752093, now seen corresponding path program 1 times [2025-01-10 00:59:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197215391] [2025-01-10 00:59:32,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:32,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 00:59:32,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 00:59:32,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:32,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:32,437 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:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197215391] [2025-01-10 00:59:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197215391] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:32,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:59:32,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085056671] [2025-01-10 00:59:32,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:32,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:59:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:32,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:59:32,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:59:32,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 204 [2025-01-10 00:59:32,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 175 transitions, 439 flow. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 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:32,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:32,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 204 [2025-01-10 00:59:32,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:36,466 INFO L124 PetriNetUnfolderBase]: 26573/58560 cut-off events. [2025-01-10 00:59:36,471 INFO L125 PetriNetUnfolderBase]: For 3102/3102 co-relation queries the response was YES. [2025-01-10 00:59:36,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100736 conditions, 58560 events. 26573/58560 cut-off events. For 3102/3102 co-relation queries the response was YES. Maximal size of possible extension queue 1707. Compared 659590 event pairs, 5180 based on Foata normal form. 22/51207 useless extension candidates. Maximal degree in co-relation 100681. Up to 37828 conditions per place. [2025-01-10 00:59:36,987 INFO L140 encePairwiseOnDemand]: 201/204 looper letters, 154 selfloop transitions, 3 changer transitions 0/242 dead transitions. [2025-01-10 00:59:36,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 242 transitions, 882 flow [2025-01-10 00:59:36,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:36,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:36,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2025-01-10 00:59:36,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2025-01-10 00:59:36,989 INFO L175 Difference]: Start difference. First operand has 186 places, 175 transitions, 439 flow. Second operand 4 states and 496 transitions. [2025-01-10 00:59:36,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 242 transitions, 882 flow [2025-01-10 00:59:36,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 242 transitions, 876 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:36,997 INFO L231 Difference]: Finished difference. Result has 187 places, 174 transitions, 432 flow [2025-01-10 00:59:36,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=187, PETRI_TRANSITIONS=174} [2025-01-10 00:59:36,998 INFO L279 CegarLoopForPetriNet]: 164 programPoint places, 23 predicate places. [2025-01-10 00:59:36,998 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 174 transitions, 432 flow [2025-01-10 00:59:36,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 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:36,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:36,998 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 00:59:36,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 00:59:36,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1898287269, now seen corresponding path program 1 times [2025-01-10 00:59:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:36,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315832927] [2025-01-10 00:59:36,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:37,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 00:59:37,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 00:59:37,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:37,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:37,148 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:37,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:37,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315832927] [2025-01-10 00:59:37,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315832927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:37,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:37,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 00:59:37,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762645338] [2025-01-10 00:59:37,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:37,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 00:59:37,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:37,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 00:59:37,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-10 00:59:37,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 204 [2025-01-10 00:59:37,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 174 transitions, 432 flow. Second operand has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 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:37,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:37,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 204 [2025-01-10 00:59:37,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand