./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:58:58,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:58:58,728 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:58,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:58:58,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:58:58,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:58:58,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:58:58,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:58:58,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:58:58,757 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:58:58,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:58:58,757 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:58:58,757 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:58:58,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:58:58,758 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:58:58,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:58:58,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:58:58,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:58:58,759 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:58:58,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:58:58,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:58,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:58,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:58,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:58,760 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:58:58,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:58:58,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:58:58,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:58:58,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:58:58,761 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-01-10 00:58:58,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:58:58,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:58:58,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:58:58,982 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:58:58,983 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:58:58,983 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_71-funloop_racing.i [2025-01-10 00:59:00,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a72766482/6e81316392694feda8eb28fd7f66eac8/FLAGa76fb9261 [2025-01-10 00:59:00,353 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:59:00,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-01-10 00:59:00,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a72766482/6e81316392694feda8eb28fd7f66eac8/FLAGa76fb9261 [2025-01-10 00:59:00,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a72766482/6e81316392694feda8eb28fd7f66eac8 [2025-01-10 00:59:00,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:59:00,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:59:00,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:00,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:59:00,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:59:00,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:00" (1/1) ... [2025-01-10 00:59:00,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3104c260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:00, skipping insertion in model container [2025-01-10 00:59:00,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:00" (1/1) ... [2025-01-10 00:59:00,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:59:00,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:00,707 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:59:00,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:00,794 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:59:00,796 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,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:00,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:00,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:59:00,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:59:00,801 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,811 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,832 INFO L138 Inliner]: procedures = 272, calls = 108, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 314 [2025-01-10 00:59:00,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:00,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:59:00,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:59:00,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:59:00,839 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,839 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,842 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,862 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 75, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 7 writes are split as follows [0, 0, 6, 1]. [2025-01-10 00:59:00,862 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,862 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,871 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,874 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,881 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,887 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,889 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,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:59:00,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:59:00,894 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:59:00,894 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:59:00,894 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,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:00,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:00,923 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,926 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,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:59:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:59:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:59:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:59:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:59:00,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:59:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:59:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:59:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:59:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:59:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:59:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:59:00,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:59:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 00:59:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 00:59:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:59:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:59:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:59:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:59:00,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:59:00,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:59:00,948 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:01,065 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:59:01,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:59:01,520 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:59:01,521 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:59:01,856 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:59:01,856 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-10 00:59:01,857 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,857 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:59:01,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:59:01,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:59:01,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:59:01,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:59:00" (1/3) ... [2025-01-10 00:59:01,864 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b674fd 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,864 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,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b674fd 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,865 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,866 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-01-10 00:59:01,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:59:01,879 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 153 locations, 1 initial locations, 20 loop locations, and 38 error locations. [2025-01-10 00:59:01,879 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:59:01,936 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 00:59:01,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 196 transitions, 399 flow [2025-01-10 00:59:02,046 INFO L124 PetriNetUnfolderBase]: 70/323 cut-off events. [2025-01-10 00:59:02,053 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 00:59:02,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 323 events. 70/323 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1914 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2025-01-10 00:59:02,060 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 196 transitions, 399 flow [2025-01-10 00:59:02,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 196 transitions, 399 flow [2025-01-10 00:59:02,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:02,088 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;@897bdfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:02,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-01-10 00:59:02,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:02,096 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:59:02,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:02,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:02,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:59:02,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:02,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:02,102 INFO L85 PathProgramCache]: Analyzing trace with hash 27124529, now seen corresponding path program 1 times [2025-01-10 00:59:02,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:02,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835328444] [2025-01-10 00:59:02,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:02,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:59:02,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:59:02,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:02,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:02,310 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:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:02,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835328444] [2025-01-10 00:59:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835328444] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431096867] [2025-01-10 00:59:02,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:02,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 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,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:02,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:02,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 196 [2025-01-10 00:59:02,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 196 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:02,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:02,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 196 [2025-01-10 00:59:02,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:02,917 INFO L124 PetriNetUnfolderBase]: 993/3383 cut-off events. [2025-01-10 00:59:02,917 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:59:02,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5263 conditions, 3383 events. 993/3383 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 30095 event pairs, 840 based on Foata normal form. 700/3595 useless extension candidates. Maximal degree in co-relation 5101. Up to 1874 conditions per place. [2025-01-10 00:59:02,933 INFO L140 encePairwiseOnDemand]: 157/196 looper letters, 68 selfloop transitions, 2 changer transitions 0/158 dead transitions. [2025-01-10 00:59:02,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 158 transitions, 463 flow [2025-01-10 00:59:02,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2025-01-10 00:59:02,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-01-10 00:59:02,944 INFO L175 Difference]: Start difference. First operand has 156 places, 196 transitions, 399 flow. Second operand 3 states and 371 transitions. [2025-01-10 00:59:02,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 158 transitions, 463 flow [2025-01-10 00:59:02,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 158 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:02,952 INFO L231 Difference]: Finished difference. Result has 156 places, 158 transitions, 333 flow [2025-01-10 00:59:02,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=156, PETRI_TRANSITIONS=158} [2025-01-10 00:59:02,958 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 0 predicate places. [2025-01-10 00:59:02,958 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 158 transitions, 333 flow [2025-01-10 00:59:02,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:02,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:02,959 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:59:02,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 840776321, now seen corresponding path program 1 times [2025-01-10 00:59:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882492702] [2025-01-10 00:59:02,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:02,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:02,993 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,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:02,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:03,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:03,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882492702] [2025-01-10 00:59:03,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882492702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:03,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710000185] [2025-01-10 00:59:03,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:03,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:03,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 00:59:03,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 00:59:03,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:03,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:03,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:03,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:59:03,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:03,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 00:59:03,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710000185] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:03,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:03,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:59:03,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732622846] [2025-01-10 00:59:03,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:03,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:59:03,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:03,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:59:03,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:59:03,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 196 [2025-01-10 00:59:03,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 158 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:03,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:03,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 196 [2025-01-10 00:59:03,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:03,589 INFO L124 PetriNetUnfolderBase]: 993/3386 cut-off events. [2025-01-10 00:59:03,589 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 00:59:03,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5279 conditions, 3386 events. 993/3386 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 30087 event pairs, 840 based on Foata normal form. 0/2898 useless extension candidates. Maximal degree in co-relation 5267. Up to 1874 conditions per place. [2025-01-10 00:59:03,602 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 68 selfloop transitions, 5 changer transitions 0/161 dead transitions. [2025-01-10 00:59:03,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 161 transitions, 491 flow [2025-01-10 00:59:03,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:59:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:59:03,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2025-01-10 00:59:03,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136054421768708 [2025-01-10 00:59:03,605 INFO L175 Difference]: Start difference. First operand has 156 places, 158 transitions, 333 flow. Second operand 6 states and 604 transitions. [2025-01-10 00:59:03,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 161 transitions, 491 flow [2025-01-10 00:59:03,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 161 transitions, 487 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:03,609 INFO L231 Difference]: Finished difference. Result has 163 places, 161 transitions, 365 flow [2025-01-10 00:59:03,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=365, PETRI_PLACES=163, PETRI_TRANSITIONS=161} [2025-01-10 00:59:03,609 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 7 predicate places. [2025-01-10 00:59:03,609 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 161 transitions, 365 flow [2025-01-10 00:59:03,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.28571428571429) internal successors, (625), 7 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:03,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:03,610 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:03,621 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:03,814 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:03,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:03,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:03,816 INFO L85 PathProgramCache]: Analyzing trace with hash -765380815, now seen corresponding path program 2 times [2025-01-10 00:59:03,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:03,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065582490] [2025-01-10 00:59:03,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:03,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:03,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 00:59:03,853 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:03,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:03,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:03,929 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:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065582490] [2025-01-10 00:59:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065582490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893079943] [2025-01-10 00:59:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:03,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:03,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:03,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:03,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 196 [2025-01-10 00:59:03,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:03,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:03,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 196 [2025-01-10 00:59:03,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,312 INFO L124 PetriNetUnfolderBase]: 1046/3469 cut-off events. [2025-01-10 00:59:04,313 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 00:59:04,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 3469 events. 1046/3469 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 30726 event pairs, 840 based on Foata normal form. 0/3016 useless extension candidates. Maximal degree in co-relation 5439. Up to 1870 conditions per place. [2025-01-10 00:59:04,325 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 95 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2025-01-10 00:59:04,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 181 transitions, 599 flow [2025-01-10 00:59:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2025-01-10 00:59:04,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5901360544217688 [2025-01-10 00:59:04,328 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 365 flow. Second operand 3 states and 347 transitions. [2025-01-10 00:59:04,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 181 transitions, 599 flow [2025-01-10 00:59:04,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 181 transitions, 585 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:04,331 INFO L231 Difference]: Finished difference. Result has 162 places, 159 transitions, 351 flow [2025-01-10 00:59:04,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=162, PETRI_TRANSITIONS=159} [2025-01-10 00:59:04,331 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 6 predicate places. [2025-01-10 00:59:04,331 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 159 transitions, 351 flow [2025-01-10 00:59:04,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:04,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,332 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:04,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:59:04,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:04,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash -765380814, now seen corresponding path program 1 times [2025-01-10 00:59:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:04,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858190651] [2025-01-10 00:59:04,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:04,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:04,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:04,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:04,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:04,434 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:04,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:04,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858190651] [2025-01-10 00:59:04,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858190651] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:04,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141831942] [2025-01-10 00:59:04,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:04,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:04,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:04,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:04,438 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:04,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:04,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:04,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:04,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:04,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:59:04,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:04,542 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:04,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:04,590 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:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141831942] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:04,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:59:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883263560] [2025-01-10 00:59:04,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:04,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:59:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:04,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:59:04,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:59:04,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 196 [2025-01-10 00:59:04,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 351 flow. Second operand has 13 states, 13 states have (on average 89.15384615384616) internal successors, (1159), 13 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:04,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:04,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 196 [2025-01-10 00:59:04,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:04,964 INFO L124 PetriNetUnfolderBase]: 993/3369 cut-off events. [2025-01-10 00:59:04,964 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2025-01-10 00:59:04,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 3369 events. 993/3369 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 29823 event pairs, 840 based on Foata normal form. 6/2911 useless extension candidates. Maximal degree in co-relation 5268. Up to 1874 conditions per place. [2025-01-10 00:59:04,979 INFO L140 encePairwiseOnDemand]: 193/196 looper letters, 68 selfloop transitions, 11 changer transitions 0/165 dead transitions. [2025-01-10 00:59:04,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 165 transitions, 545 flow [2025-01-10 00:59:04,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:59:04,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:59:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1141 transitions. [2025-01-10 00:59:04,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2025-01-10 00:59:04,982 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 351 flow. Second operand 12 states and 1141 transitions. [2025-01-10 00:59:04,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 165 transitions, 545 flow [2025-01-10 00:59:04,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 165 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:04,989 INFO L231 Difference]: Finished difference. Result has 177 places, 165 transitions, 431 flow [2025-01-10 00:59:04,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=431, PETRI_PLACES=177, PETRI_TRANSITIONS=165} [2025-01-10 00:59:04,990 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 21 predicate places. [2025-01-10 00:59:04,990 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 165 transitions, 431 flow [2025-01-10 00:59:04,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.15384615384616) internal successors, (1159), 13 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:04,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:04,993 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-01-10 00:59:05,003 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:05,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:05,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:05,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:05,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1018918194, now seen corresponding path program 2 times [2025-01-10 00:59:05,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:05,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095554789] [2025-01-10 00:59:05,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:05,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:05,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 00:59:05,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 14 statements. [2025-01-10 00:59:05,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:05,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:05,297 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:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095554789] [2025-01-10 00:59:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095554789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:05,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:05,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:05,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925382991] [2025-01-10 00:59:05,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:05,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:05,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:05,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:05,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 196 [2025-01-10 00:59:05,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 165 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:05,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:05,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 196 [2025-01-10 00:59:05,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:05,637 INFO L124 PetriNetUnfolderBase]: 971/3196 cut-off events. [2025-01-10 00:59:05,638 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-01-10 00:59:05,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 3196 events. 971/3196 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 28703 event pairs, 0 based on Foata normal form. 1/2793 useless extension candidates. Maximal degree in co-relation 5052. Up to 1843 conditions per place. [2025-01-10 00:59:05,654 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 101 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-01-10 00:59:05,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 188 transitions, 683 flow [2025-01-10 00:59:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-01-10 00:59:05,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6054421768707483 [2025-01-10 00:59:05,656 INFO L175 Difference]: Start difference. First operand has 177 places, 165 transitions, 431 flow. Second operand 3 states and 356 transitions. [2025-01-10 00:59:05,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 188 transitions, 683 flow [2025-01-10 00:59:05,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 188 transitions, 635 flow, removed 19 selfloop flow, removed 5 redundant places. [2025-01-10 00:59:05,664 INFO L231 Difference]: Finished difference. Result has 175 places, 165 transitions, 393 flow [2025-01-10 00:59:05,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=175, PETRI_TRANSITIONS=165} [2025-01-10 00:59:05,665 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, 19 predicate places. [2025-01-10 00:59:05,665 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 165 transitions, 393 flow [2025-01-10 00:59:05,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:05,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:05,666 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:05,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:59:05,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:05,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash -594558427, now seen corresponding path program 1 times [2025-01-10 00:59:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:05,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471010923] [2025-01-10 00:59:05,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:05,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:05,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 00:59:05,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 00:59:05,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:05,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:05,833 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:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471010923] [2025-01-10 00:59:05,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471010923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:05,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:59:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291037056] [2025-01-10 00:59:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:05,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:05,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:05,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:05,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 196 [2025-01-10 00:59:05,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 165 transitions, 393 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:05,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:05,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 196 [2025-01-10 00:59:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:06,017 INFO L124 PetriNetUnfolderBase]: 72/276 cut-off events. [2025-01-10 00:59:06,017 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-01-10 00:59:06,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 276 events. 72/276 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1125 event pairs, 34 based on Foata normal form. 44/292 useless extension candidates. Maximal degree in co-relation 479. Up to 132 conditions per place. [2025-01-10 00:59:06,019 INFO L140 encePairwiseOnDemand]: 192/196 looper letters, 61 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-01-10 00:59:06,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 90 transitions, 362 flow [2025-01-10 00:59:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 399 transitions. [2025-01-10 00:59:06,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2025-01-10 00:59:06,020 INFO L175 Difference]: Start difference. First operand has 175 places, 165 transitions, 393 flow. Second operand 4 states and 399 transitions. [2025-01-10 00:59:06,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 90 transitions, 362 flow [2025-01-10 00:59:06,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 90 transitions, 356 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 00:59:06,022 INFO L231 Difference]: Finished difference. Result has 80 places, 66 transitions, 186 flow [2025-01-10 00:59:06,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=80, PETRI_TRANSITIONS=66} [2025-01-10 00:59:06,022 INFO L279 CegarLoopForPetriNet]: 156 programPoint places, -76 predicate places. [2025-01-10 00:59:06,022 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 66 transitions, 186 flow [2025-01-10 00:59:06,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:06,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:06,023 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 00:59:06,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:59:06,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2025-01-10 00:59:06,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1251441047, now seen corresponding path program 1 times [2025-01-10 00:59:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:06,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511550153] [2025-01-10 00:59:06,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:06,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:59:06,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:59:06,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:06,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:06,055 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:06,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 00:59:06,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 00:59:06,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:06,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:06,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:06,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:06,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2025-01-10 00:59:06,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 50 remaining) [2025-01-10 00:59:06,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 50 remaining) [2025-01-10 00:59:06,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 50 remaining) [2025-01-10 00:59:06,101 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (44 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 50 remaining) [2025-01-10 00:59:06,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (31 of 50 remaining) [2025-01-10 00:59:06,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 50 remaining) [2025-01-10 00:59:06,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 50 remaining) [2025-01-10 00:59:06,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 50 remaining) [2025-01-10 00:59:06,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 50 remaining) [2025-01-10 00:59:06,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 50 remaining) [2025-01-10 00:59:06,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 50 remaining) [2025-01-10 00:59:06,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 50 remaining) [2025-01-10 00:59:06,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (22 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (11 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 50 remaining) [2025-01-10 00:59:06,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 50 remaining) [2025-01-10 00:59:06,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 50 remaining) [2025-01-10 00:59:06,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 50 remaining) [2025-01-10 00:59:06,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 50 remaining) [2025-01-10 00:59:06,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 50 remaining) [2025-01-10 00:59:06,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:59:06,107 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-01-10 00:59:06,110 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:06,110 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:59:06,153 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 00:59:06,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 259 transitions, 534 flow [2025-01-10 00:59:06,193 INFO L124 PetriNetUnfolderBase]: 113/525 cut-off events. [2025-01-10 00:59:06,194 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 00:59:06,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 525 events. 113/525 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3402 event pairs, 0 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 325. Up to 12 conditions per place. [2025-01-10 00:59:06,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 259 transitions, 534 flow [2025-01-10 00:59:06,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 259 transitions, 534 flow [2025-01-10 00:59:06,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:06,205 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;@897bdfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:06,205 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-01-10 00:59:06,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:06,208 INFO L124 PetriNetUnfolderBase]: 1/6 cut-off events. [2025-01-10 00:59:06,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:06,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:06,208 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-01-10 00:59:06,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:06,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:06,209 INFO L85 PathProgramCache]: Analyzing trace with hash 35097585, now seen corresponding path program 1 times [2025-01-10 00:59:06,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:06,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956312580] [2025-01-10 00:59:06,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:06,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:06,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 00:59:06,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 00:59:06,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:06,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:06,243 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:06,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956312580] [2025-01-10 00:59:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956312580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:06,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257800143] [2025-01-10 00:59:06,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:06,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:06,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:06,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:06,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259 [2025-01-10 00:59:06,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 259 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:06,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:06,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259 [2025-01-10 00:59:06,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:11,655 INFO L124 PetriNetUnfolderBase]: 43644/96745 cut-off events. [2025-01-10 00:59:11,656 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2025-01-10 00:59:11,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159969 conditions, 96745 events. 43644/96745 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 2832. Compared 1167521 event pairs, 38368 based on Foata normal form. 23359/107553 useless extension candidates. Maximal degree in co-relation 147592. Up to 63076 conditions per place. [2025-01-10 00:59:12,339 INFO L140 encePairwiseOnDemand]: 208/259 looper letters, 92 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2025-01-10 00:59:12,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 208 transitions, 620 flow [2025-01-10 00:59:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:12,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:12,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-01-10 00:59:12,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6241956241956242 [2025-01-10 00:59:12,346 INFO L175 Difference]: Start difference. First operand has 206 places, 259 transitions, 534 flow. Second operand 3 states and 485 transitions. [2025-01-10 00:59:12,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 208 transitions, 620 flow [2025-01-10 00:59:12,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 208 transitions, 620 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:12,350 INFO L231 Difference]: Finished difference. Result has 205 places, 208 transitions, 442 flow [2025-01-10 00:59:12,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=205, PETRI_TRANSITIONS=208} [2025-01-10 00:59:12,351 INFO L279 CegarLoopForPetriNet]: 206 programPoint places, -1 predicate places. [2025-01-10 00:59:12,351 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 208 transitions, 442 flow [2025-01-10 00:59:12,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:12,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:12,352 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:12,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:59:12,352 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:12,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:12,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1087941316, now seen corresponding path program 1 times [2025-01-10 00:59:12,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:12,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636780738] [2025-01-10 00:59:12,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:12,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:12,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:12,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:12,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:12,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:12,394 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:12,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:12,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636780738] [2025-01-10 00:59:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636780738] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:12,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104814226] [2025-01-10 00:59:12,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:12,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:12,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:12,402 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:12,409 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:12,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:12,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:12,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:12,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:12,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-10 00:59:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:12,486 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:12,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:12,496 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:12,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104814226] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:12,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:12,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-01-10 00:59:12,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908373445] [2025-01-10 00:59:12,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 00:59:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:12,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 00:59:12,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-10 00:59:12,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259 [2025-01-10 00:59:12,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 208 transitions, 442 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:12,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:12,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259 [2025-01-10 00:59:12,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:17,550 INFO L124 PetriNetUnfolderBase]: 43644/96748 cut-off events. [2025-01-10 00:59:17,550 INFO L125 PetriNetUnfolderBase]: For 297/297 co-relation queries the response was YES. [2025-01-10 00:59:17,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159985 conditions, 96748 events. 43644/96748 cut-off events. For 297/297 co-relation queries the response was YES. Maximal size of possible extension queue 2833. Compared 1167472 event pairs, 38368 based on Foata normal form. 0/84197 useless extension candidates. Maximal degree in co-relation 159972. Up to 63076 conditions per place. [2025-01-10 00:59:18,048 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 92 selfloop transitions, 5 changer transitions 0/211 dead transitions. [2025-01-10 00:59:18,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 211 transitions, 648 flow [2025-01-10 00:59:18,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 00:59:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 00:59:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions. [2025-01-10 00:59:18,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2025-01-10 00:59:18,051 INFO L175 Difference]: Start difference. First operand has 205 places, 208 transitions, 442 flow. Second operand 6 states and 784 transitions. [2025-01-10 00:59:18,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 211 transitions, 648 flow [2025-01-10 00:59:18,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 211 transitions, 644 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:18,054 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 474 flow [2025-01-10 00:59:18,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2025-01-10 00:59:18,055 INFO L279 CegarLoopForPetriNet]: 206 programPoint places, 6 predicate places. [2025-01-10 00:59:18,055 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 474 flow [2025-01-10 00:59:18,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:18,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:18,055 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:18,062 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:18,256 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:18,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:18,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash 953297073, now seen corresponding path program 2 times [2025-01-10 00:59:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470439984] [2025-01-10 00:59:18,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:18,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:18,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-01-10 00:59:18,267 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:18,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:18,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:18,291 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:18,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470439984] [2025-01-10 00:59:18,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470439984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:18,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:18,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:18,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131862387] [2025-01-10 00:59:18,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:18,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:18,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:18,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:18,324 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 259 [2025-01-10 00:59:18,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:18,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:18,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 259 [2025-01-10 00:59:18,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:24,229 INFO L124 PetriNetUnfolderBase]: 46096/100421 cut-off events. [2025-01-10 00:59:24,229 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-10 00:59:24,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167117 conditions, 100421 events. 46096/100421 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 3017. Compared 1204899 event pairs, 38347 based on Foata normal form. 0/88044 useless extension candidates. Maximal degree in co-relation 167082. Up to 62985 conditions per place. [2025-01-10 00:59:24,793 INFO L140 encePairwiseOnDemand]: 255/259 looper letters, 141 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-01-10 00:59:24,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 253 transitions, 844 flow [2025-01-10 00:59:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-10 00:59:24,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061776061776062 [2025-01-10 00:59:24,795 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 474 flow. Second operand 3 states and 471 transitions. [2025-01-10 00:59:24,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 253 transitions, 844 flow [2025-01-10 00:59:24,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 253 transitions, 830 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:24,798 INFO L231 Difference]: Finished difference. Result has 211 places, 209 transitions, 460 flow [2025-01-10 00:59:24,799 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=211, PETRI_TRANSITIONS=209} [2025-01-10 00:59:24,799 INFO L279 CegarLoopForPetriNet]: 206 programPoint places, 5 predicate places. [2025-01-10 00:59:24,799 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 209 transitions, 460 flow [2025-01-10 00:59:24,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:24,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:24,800 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1] [2025-01-10 00:59:24,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 00:59:24,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:24,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:24,800 INFO L85 PathProgramCache]: Analyzing trace with hash 953297074, now seen corresponding path program 1 times [2025-01-10 00:59:24,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:24,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361334960] [2025-01-10 00:59:24,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:24,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:24,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:24,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:24,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:24,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:24,859 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:24,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:24,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361334960] [2025-01-10 00:59:24,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361334960] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 00:59:24,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613472804] [2025-01-10 00:59:24,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:24,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 00:59:24,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:24,861 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:24,863 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:24,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:24,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:24,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:24,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:24,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 00:59:24,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 00:59:24,939 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:24,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 00:59:24,985 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:24,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613472804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 00:59:24,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 00:59:24,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-01-10 00:59:24,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565502737] [2025-01-10 00:59:24,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 00:59:24,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-10 00:59:24,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:24,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-10 00:59:24,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-10 00:59:24,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 259 [2025-01-10 00:59:24,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 209 transitions, 460 flow. Second operand has 13 states, 13 states have (on average 115.15384615384616) internal successors, (1497), 13 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:24,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:24,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 259 [2025-01-10 00:59:24,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:30,676 INFO L124 PetriNetUnfolderBase]: 43644/96446 cut-off events. [2025-01-10 00:59:30,676 INFO L125 PetriNetUnfolderBase]: For 1309/1309 co-relation queries the response was YES. [2025-01-10 00:59:30,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160696 conditions, 96446 events. 43644/96446 cut-off events. For 1309/1309 co-relation queries the response was YES. Maximal size of possible extension queue 2829. Compared 1160676 event pairs, 38368 based on Foata normal form. 6/84210 useless extension candidates. Maximal degree in co-relation 160643. Up to 63076 conditions per place. [2025-01-10 00:59:31,220 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 92 selfloop transitions, 11 changer transitions 0/215 dead transitions. [2025-01-10 00:59:31,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 215 transitions, 702 flow [2025-01-10 00:59:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 00:59:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 00:59:31,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1477 transitions. [2025-01-10 00:59:31,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4752252252252252 [2025-01-10 00:59:31,223 INFO L175 Difference]: Start difference. First operand has 211 places, 209 transitions, 460 flow. Second operand 12 states and 1477 transitions. [2025-01-10 00:59:31,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 215 transitions, 702 flow [2025-01-10 00:59:31,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 215 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:31,266 INFO L231 Difference]: Finished difference. Result has 226 places, 215 transitions, 540 flow [2025-01-10 00:59:31,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=540, PETRI_PLACES=226, PETRI_TRANSITIONS=215} [2025-01-10 00:59:31,266 INFO L279 CegarLoopForPetriNet]: 206 programPoint places, 20 predicate places. [2025-01-10 00:59:31,267 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 215 transitions, 540 flow [2025-01-10 00:59:31,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.15384615384616) internal successors, (1497), 13 states have internal predecessors, (1497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:31,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:31,268 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1] [2025-01-10 00:59:31,273 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:31,468 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:31,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-10 00:59:31,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 147054546, now seen corresponding path program 2 times [2025-01-10 00:59:31,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479858238] [2025-01-10 00:59:31,469 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 00:59:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:31,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-01-10 00:59:31,479 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:31,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 00:59:31,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:31,519 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:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479858238] [2025-01-10 00:59:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479858238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:31,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837868527] [2025-01-10 00:59:31,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:31,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:31,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:31,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:31,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 259 [2025-01-10 00:59:31,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 215 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:31,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:31,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 259 [2025-01-10 00:59:31,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand