./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_81-list_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_81-list_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 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 00:59:35,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 00:59:35,295 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:59:35,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 00:59:35,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 00:59:35,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 00:59:35,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 00:59:35,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 00:59:35,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 00:59:35,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 00:59:35,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 00:59:35,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 00:59:35,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 00:59:35,328 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 00:59:35,328 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 00:59:35,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 00:59:35,328 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 00:59:35,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 00:59:35,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 00:59:35,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 00:59:35,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 00:59:35,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:35,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:35,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 00:59:35,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 00:59:35,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 00:59:35,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 00:59:35,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 00:59:35,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 00:59:35,331 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 -> 3de6ec2acea23c0ab47fbc2e02ad0931145060ca78b80531ef692b3505f9553b [2025-01-10 00:59:35,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 00:59:35,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 00:59:35,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 00:59:35,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 00:59:35,558 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 00:59:35,559 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_81-list_racing.i [2025-01-10 00:59:36,673 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acc3766cd/bc7d3d5189a6451e89d447b13938a7a1/FLAG9f12a3be6 [2025-01-10 00:59:36,998 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 00:59:36,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_81-list_racing.i [2025-01-10 00:59:37,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acc3766cd/bc7d3d5189a6451e89d447b13938a7a1/FLAG9f12a3be6 [2025-01-10 00:59:37,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/acc3766cd/bc7d3d5189a6451e89d447b13938a7a1 [2025-01-10 00:59:37,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 00:59:37,247 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 00:59:37,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:37,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 00:59:37,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 00:59:37,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:37" (1/1) ... [2025-01-10 00:59:37,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648439a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:37, skipping insertion in model container [2025-01-10 00:59:37,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:59:37" (1/1) ... [2025-01-10 00:59:37,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 00:59:37,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:37,642 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 00:59:37,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 00:59:37,717 INFO L204 MainTranslator]: Completed translation [2025-01-10 00:59:37,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:37 WrapperNode [2025-01-10 00:59:37,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 00:59:37,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:37,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 00:59:37,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 00:59:37,723 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:37" (1/1) ... [2025-01-10 00:59:37,743 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:37" (1/1) ... [2025-01-10 00:59:37,769 INFO L138 Inliner]: procedures = 279, calls = 60, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2025-01-10 00:59:37,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 00:59:37,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 00:59:37,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 00:59:37,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 00:59:37,776 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:37" (1/1) ... [2025-01-10 00:59:37,776 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:37" (1/1) ... [2025-01-10 00:59:37,783 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:37" (1/1) ... [2025-01-10 00:59:37,810 INFO L175 MemorySlicer]: Split 30 memory accesses to 6 slices as follows [2, 5, 2, 5, 14, 2]. 47 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 0, 5, 0, 0]. The 10 writes are split as follows [0, 0, 1, 0, 8, 1]. [2025-01-10 00:59:37,811 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:37" (1/1) ... [2025-01-10 00:59:37,811 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:37" (1/1) ... [2025-01-10 00:59:37,831 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:37" (1/1) ... [2025-01-10 00:59:37,836 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:37" (1/1) ... [2025-01-10 00:59:37,839 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:37" (1/1) ... [2025-01-10 00:59:37,841 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:37" (1/1) ... [2025-01-10 00:59:37,842 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:37" (1/1) ... [2025-01-10 00:59:37,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 00:59:37,845 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 00:59:37,846 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 00:59:37,846 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 00:59:37,847 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:37" (1/1) ... [2025-01-10 00:59:37,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 00:59:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 00:59:37,870 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:37,873 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:37,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2025-01-10 00:59:37,891 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-01-10 00:59:37,891 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-01-10 00:59:37,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 00:59:37,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 00:59:37,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 00:59:37,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 00:59:37,894 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:38,047 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 00:59:38,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 00:59:38,428 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 00:59:38,428 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 00:59:38,669 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 00:59:38,669 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2025-01-10 00:59:38,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:38 BoogieIcfgContainer [2025-01-10 00:59:38,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 00:59:38,671 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 00:59:38,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 00:59:38,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 00:59:38,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:59:37" (1/3) ... [2025-01-10 00:59:38,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4778a26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:38, skipping insertion in model container [2025-01-10 00:59:38,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:59:37" (2/3) ... [2025-01-10 00:59:38,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4778a26f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:59:38, skipping insertion in model container [2025-01-10 00:59:38,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:59:38" (3/3) ... [2025-01-10 00:59:38,676 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_81-list_racing.i [2025-01-10 00:59:38,686 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 00:59:38,687 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_81-list_racing.i that has 3 procedures, 110 locations, 1 initial locations, 10 loop locations, and 38 error locations. [2025-01-10 00:59:38,687 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 00:59:38,775 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 00:59:38,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 130 transitions, 280 flow [2025-01-10 00:59:38,867 INFO L124 PetriNetUnfolderBase]: 38/266 cut-off events. [2025-01-10 00:59:38,869 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-10 00:59:38,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 266 events. 38/266 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1403 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 140. Up to 8 conditions per place. [2025-01-10 00:59:38,875 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 130 transitions, 280 flow [2025-01-10 00:59:38,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 130 transitions, 280 flow [2025-01-10 00:59:38,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:38,897 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;@745c8935, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:38,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-01-10 00:59:38,901 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:38,902 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:59:38,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:38,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:38,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:59:38,903 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:38,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:38,906 INFO L85 PathProgramCache]: Analyzing trace with hash 21689, now seen corresponding path program 1 times [2025-01-10 00:59:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560774470] [2025-01-10 00:59:38,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:39,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:59:39,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:59:39,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:39,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:39,226 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:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560774470] [2025-01-10 00:59:39,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560774470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:39,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:39,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594316778] [2025-01-10 00:59:39,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:39,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:39,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:39,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:39,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 130 [2025-01-10 00:59:39,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 130 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:39,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:39,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 130 [2025-01-10 00:59:39,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:39,987 INFO L124 PetriNetUnfolderBase]: 2588/6122 cut-off events. [2025-01-10 00:59:39,987 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-10 00:59:39,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10341 conditions, 6122 events. 2588/6122 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 49564 event pairs, 2402 based on Foata normal form. 464/5612 useless extension candidates. Maximal degree in co-relation 8989. Up to 4126 conditions per place. [2025-01-10 00:59:40,032 INFO L140 encePairwiseOnDemand]: 113/130 looper letters, 50 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2025-01-10 00:59:40,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 114 transitions, 352 flow [2025-01-10 00:59:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-01-10 00:59:40,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6487179487179487 [2025-01-10 00:59:40,045 INFO L175 Difference]: Start difference. First operand has 116 places, 130 transitions, 280 flow. Second operand 3 states and 253 transitions. [2025-01-10 00:59:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 114 transitions, 352 flow [2025-01-10 00:59:40,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 114 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 00:59:40,056 INFO L231 Difference]: Finished difference. Result has 115 places, 114 transitions, 252 flow [2025-01-10 00:59:40,057 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=115, PETRI_TRANSITIONS=114} [2025-01-10 00:59:40,060 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -1 predicate places. [2025-01-10 00:59:40,060 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 114 transitions, 252 flow [2025-01-10 00:59:40,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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:40,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:40,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:59:40,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 00:59:40,061 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:40,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:40,061 INFO L85 PathProgramCache]: Analyzing trace with hash 21690, now seen corresponding path program 1 times [2025-01-10 00:59:40,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:40,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091840163] [2025-01-10 00:59:40,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:40,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:40,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:59:40,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:59:40,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:40,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:40,233 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:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091840163] [2025-01-10 00:59:40,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091840163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:40,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:40,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:40,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999356218] [2025-01-10 00:59:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:40,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:40,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:40,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:40,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 130 [2025-01-10 00:59:40,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 114 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:40,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:40,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 130 [2025-01-10 00:59:40,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:40,709 INFO L124 PetriNetUnfolderBase]: 2588/6120 cut-off events. [2025-01-10 00:59:40,709 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2025-01-10 00:59:40,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10341 conditions, 6120 events. 2588/6120 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 49570 event pairs, 2402 based on Foata normal form. 2/5148 useless extension candidates. Maximal degree in co-relation 10329. Up to 4126 conditions per place. [2025-01-10 00:59:40,746 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 49 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-01-10 00:59:40,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 112 transitions, 350 flow [2025-01-10 00:59:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2025-01-10 00:59:40,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6205128205128205 [2025-01-10 00:59:40,750 INFO L175 Difference]: Start difference. First operand has 115 places, 114 transitions, 252 flow. Second operand 3 states and 242 transitions. [2025-01-10 00:59:40,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 112 transitions, 350 flow [2025-01-10 00:59:40,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 112 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:40,754 INFO L231 Difference]: Finished difference. Result has 113 places, 112 transitions, 248 flow [2025-01-10 00:59:40,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=112} [2025-01-10 00:59:40,755 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -3 predicate places. [2025-01-10 00:59:40,755 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 112 transitions, 248 flow [2025-01-10 00:59:40,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 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:40,756 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:40,756 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 00:59:40,756 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 646769148, now seen corresponding path program 1 times [2025-01-10 00:59:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617679618] [2025-01-10 00:59:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:40,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:40,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:40,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:40,855 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:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617679618] [2025-01-10 00:59:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617679618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:40,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286903540] [2025-01-10 00:59:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:40,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:40,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 130 [2025-01-10 00:59:40,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 112 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:40,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:40,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 130 [2025-01-10 00:59:40,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:41,381 INFO L124 PetriNetUnfolderBase]: 2956/6650 cut-off events. [2025-01-10 00:59:41,381 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-10 00:59:41,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11471 conditions, 6650 events. 2956/6650 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 54519 event pairs, 2046 based on Foata normal form. 0/5737 useless extension candidates. Maximal degree in co-relation 11459. Up to 3553 conditions per place. [2025-01-10 00:59:41,414 INFO L140 encePairwiseOnDemand]: 126/130 looper letters, 83 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-01-10 00:59:41,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 142 transitions, 478 flow [2025-01-10 00:59:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:41,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:41,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 270 transitions. [2025-01-10 00:59:41,417 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2025-01-10 00:59:41,417 INFO L175 Difference]: Start difference. First operand has 113 places, 112 transitions, 248 flow. Second operand 3 states and 270 transitions. [2025-01-10 00:59:41,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 142 transitions, 478 flow [2025-01-10 00:59:41,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 142 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:41,421 INFO L231 Difference]: Finished difference. Result has 111 places, 110 transitions, 244 flow [2025-01-10 00:59:41,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=111, PETRI_TRANSITIONS=110} [2025-01-10 00:59:41,423 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -5 predicate places. [2025-01-10 00:59:41,423 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 110 transitions, 244 flow [2025-01-10 00:59:41,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 3 states have internal predecessors, (187), 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:41,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:41,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 00:59:41,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 00:59:41,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:41,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash 646769149, now seen corresponding path program 1 times [2025-01-10 00:59:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:41,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320867706] [2025-01-10 00:59:41,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:41,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:41,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 00:59:41,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 00:59:41,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:41,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:41,541 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:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320867706] [2025-01-10 00:59:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320867706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:41,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:41,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105738925] [2025-01-10 00:59:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:41,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:41,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:41,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:41,593 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 130 [2025-01-10 00:59:41,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 110 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:41,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:41,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 130 [2025-01-10 00:59:41,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:41,953 INFO L124 PetriNetUnfolderBase]: 2511/5835 cut-off events. [2025-01-10 00:59:41,953 INFO L125 PetriNetUnfolderBase]: For 355/360 co-relation queries the response was YES. [2025-01-10 00:59:41,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 5835 events. 2511/5835 cut-off events. For 355/360 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 46739 event pairs, 2165 based on Foata normal form. 1/5019 useless extension candidates. Maximal degree in co-relation 9080. Up to 3977 conditions per place. [2025-01-10 00:59:41,977 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 52 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2025-01-10 00:59:41,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 113 transitions, 360 flow [2025-01-10 00:59:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-01-10 00:59:41,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6384615384615384 [2025-01-10 00:59:41,979 INFO L175 Difference]: Start difference. First operand has 111 places, 110 transitions, 244 flow. Second operand 3 states and 249 transitions. [2025-01-10 00:59:41,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 113 transitions, 360 flow [2025-01-10 00:59:41,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 113 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:41,987 INFO L231 Difference]: Finished difference. Result has 112 places, 112 transitions, 261 flow [2025-01-10 00:59:41,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=112, PETRI_TRANSITIONS=112} [2025-01-10 00:59:41,989 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -4 predicate places. [2025-01-10 00:59:41,989 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 112 transitions, 261 flow [2025-01-10 00:59:41,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 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:41,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:41,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:41,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 00:59:41,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash 677189956, now seen corresponding path program 1 times [2025-01-10 00:59:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966086096] [2025-01-10 00:59:41,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:42,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:42,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:42,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:42,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:42,130 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:42,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966086096] [2025-01-10 00:59:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966086096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484332053] [2025-01-10 00:59:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:42,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:42,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:42,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:42,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 130 [2025-01-10 00:59:42,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 112 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:42,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:42,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 130 [2025-01-10 00:59:42,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:42,693 INFO L124 PetriNetUnfolderBase]: 3564/8440 cut-off events. [2025-01-10 00:59:42,694 INFO L125 PetriNetUnfolderBase]: For 385/390 co-relation queries the response was YES. [2025-01-10 00:59:42,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14339 conditions, 8440 events. 3564/8440 cut-off events. For 385/390 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 73829 event pairs, 2643 based on Foata normal form. 193/7213 useless extension candidates. Maximal degree in co-relation 13324. Up to 5038 conditions per place. [2025-01-10 00:59:42,725 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 92 selfloop transitions, 4 changer transitions 0/153 dead transitions. [2025-01-10 00:59:42,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 153 transitions, 548 flow [2025-01-10 00:59:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:42,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2025-01-10 00:59:42,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2025-01-10 00:59:42,726 INFO L175 Difference]: Start difference. First operand has 112 places, 112 transitions, 261 flow. Second operand 3 states and 285 transitions. [2025-01-10 00:59:42,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 153 transitions, 548 flow [2025-01-10 00:59:42,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 153 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:42,729 INFO L231 Difference]: Finished difference. Result has 114 places, 114 transitions, 284 flow [2025-01-10 00:59:42,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=284, PETRI_PLACES=114, PETRI_TRANSITIONS=114} [2025-01-10 00:59:42,730 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -2 predicate places. [2025-01-10 00:59:42,730 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 114 transitions, 284 flow [2025-01-10 00:59:42,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:42,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:42,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:42,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 00:59:42,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:42,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:42,731 INFO L85 PathProgramCache]: Analyzing trace with hash 677189955, now seen corresponding path program 1 times [2025-01-10 00:59:42,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:42,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265822990] [2025-01-10 00:59:42,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:42,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 00:59:42,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 00:59:42,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:42,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:42,817 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:42,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:42,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265822990] [2025-01-10 00:59:42,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265822990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:42,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:42,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 00:59:42,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621523194] [2025-01-10 00:59:42,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:42,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:42,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:42,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:42,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:42,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 130 [2025-01-10 00:59:42,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 114 transitions, 284 flow. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 00:59:42,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:42,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 130 [2025-01-10 00:59:42,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:43,439 INFO L124 PetriNetUnfolderBase]: 4125/8995 cut-off events. [2025-01-10 00:59:43,440 INFO L125 PetriNetUnfolderBase]: For 1602/1794 co-relation queries the response was YES. [2025-01-10 00:59:43,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16830 conditions, 8995 events. 4125/8995 cut-off events. For 1602/1794 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 73588 event pairs, 2610 based on Foata normal form. 383/8160 useless extension candidates. Maximal degree in co-relation 15814. Up to 4677 conditions per place. [2025-01-10 00:59:43,486 INFO L140 encePairwiseOnDemand]: 124/130 looper letters, 94 selfloop transitions, 6 changer transitions 0/156 dead transitions. [2025-01-10 00:59:43,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 156 transitions, 584 flow [2025-01-10 00:59:43,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 00:59:43,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 00:59:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-01-10 00:59:43,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282051282051282 [2025-01-10 00:59:43,488 INFO L175 Difference]: Start difference. First operand has 114 places, 114 transitions, 284 flow. Second operand 3 states and 284 transitions. [2025-01-10 00:59:43,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 156 transitions, 584 flow [2025-01-10 00:59:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 156 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 00:59:43,492 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 328 flow [2025-01-10 00:59:43,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2025-01-10 00:59:43,492 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 1 predicate places. [2025-01-10 00:59:43,492 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 328 flow [2025-01-10 00:59:43,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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:43,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:43,493 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:43,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 00:59:43,493 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:43,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:43,493 INFO L85 PathProgramCache]: Analyzing trace with hash -482036568, now seen corresponding path program 1 times [2025-01-10 00:59:43,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:43,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399044703] [2025-01-10 00:59:43,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:43,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:43,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 00:59:43,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 00:59:43,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:43,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:43,649 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:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399044703] [2025-01-10 00:59:43,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399044703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:43,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:43,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:59:43,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265724265] [2025-01-10 00:59:43,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 00:59:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:43,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 00:59:43,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 00:59:43,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 130 [2025-01-10 00:59:43,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 64.6) internal successors, (323), 5 states have internal predecessors, (323), 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:43,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:43,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 130 [2025-01-10 00:59:43,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:44,248 INFO L124 PetriNetUnfolderBase]: 2268/5288 cut-off events. [2025-01-10 00:59:44,248 INFO L125 PetriNetUnfolderBase]: For 3523/4745 co-relation queries the response was YES. [2025-01-10 00:59:44,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10008 conditions, 5288 events. 2268/5288 cut-off events. For 3523/4745 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 42293 event pairs, 1880 based on Foata normal form. 51/4600 useless extension candidates. Maximal degree in co-relation 8955. Up to 3606 conditions per place. [2025-01-10 00:59:44,273 INFO L140 encePairwiseOnDemand]: 125/130 looper letters, 59 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-01-10 00:59:44,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 121 transitions, 456 flow [2025-01-10 00:59:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:44,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 313 transitions. [2025-01-10 00:59:44,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6019230769230769 [2025-01-10 00:59:44,278 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 328 flow. Second operand 4 states and 313 transitions. [2025-01-10 00:59:44,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 121 transitions, 456 flow [2025-01-10 00:59:44,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 121 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 00:59:44,283 INFO L231 Difference]: Finished difference. Result has 119 places, 117 transitions, 324 flow [2025-01-10 00:59:44,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=119, PETRI_TRANSITIONS=117} [2025-01-10 00:59:44,285 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, 3 predicate places. [2025-01-10 00:59:44,286 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 117 transitions, 324 flow [2025-01-10 00:59:44,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.6) internal successors, (323), 5 states have internal predecessors, (323), 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:44,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:44,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:44,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 00:59:44,286 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:44,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2055547550, now seen corresponding path program 1 times [2025-01-10 00:59:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340814522] [2025-01-10 00:59:44,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:44,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:59:44,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:59:44,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:44,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:44,358 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:44,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:44,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340814522] [2025-01-10 00:59:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340814522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:44,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:44,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 00:59:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678315824] [2025-01-10 00:59:44,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:44,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 00:59:44,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:44,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 00:59:44,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 00:59:44,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 130 [2025-01-10 00:59:44,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 117 transitions, 324 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 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:44,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:44,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 130 [2025-01-10 00:59:44,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 00:59:44,395 INFO L124 PetriNetUnfolderBase]: 12/71 cut-off events. [2025-01-10 00:59:44,395 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 00:59:44,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 71 events. 12/71 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 199 event pairs, 6 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 144. Up to 26 conditions per place. [2025-01-10 00:59:44,396 INFO L140 encePairwiseOnDemand]: 127/130 looper letters, 16 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-01-10 00:59:44,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 150 flow [2025-01-10 00:59:44,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 00:59:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 00:59:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2025-01-10 00:59:44,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365384615384615 [2025-01-10 00:59:44,397 INFO L175 Difference]: Start difference. First operand has 119 places, 117 transitions, 324 flow. Second operand 4 states and 279 transitions. [2025-01-10 00:59:44,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 150 flow [2025-01-10 00:59:44,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 124 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-01-10 00:59:44,398 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 80 flow [2025-01-10 00:59:44,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=130, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-01-10 00:59:44,398 INFO L279 CegarLoopForPetriNet]: 116 programPoint places, -80 predicate places. [2025-01-10 00:59:44,398 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 80 flow [2025-01-10 00:59:44,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 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:44,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:44,400 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:44,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 00:59:44,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2025-01-10 00:59:44,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash -2058230955, now seen corresponding path program 1 times [2025-01-10 00:59:44,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:44,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809834137] [2025-01-10 00:59:44,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:44,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:44,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:59:44,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:59:44,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:44,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:44,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 00:59:44,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 00:59:44,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 00:59:44,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 00:59:44,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 00:59:44,489 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 00:59:44,490 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2025-01-10 00:59:44,491 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14ASSERT_VIOLATIONMEMORY_LEAK (49 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2025-01-10 00:59:44,492 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (36 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2025-01-10 00:59:44,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2_funErr14ASSERT_VIOLATIONMEMORY_LEAK (10 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 65 remaining) [2025-01-10 00:59:44,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 65 remaining) [2025-01-10 00:59:44,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 00:59:44,495 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 00:59:44,497 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 00:59:44,497 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 00:59:44,543 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-01-10 00:59:44,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 225 transitions, 494 flow [2025-01-10 00:59:44,598 INFO L124 PetriNetUnfolderBase]: 147/827 cut-off events. [2025-01-10 00:59:44,598 INFO L125 PetriNetUnfolderBase]: For 72/85 co-relation queries the response was YES. [2025-01-10 00:59:44,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 827 events. 147/827 cut-off events. For 72/85 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5973 event pairs, 2 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 525. Up to 32 conditions per place. [2025-01-10 00:59:44,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 225 transitions, 494 flow [2025-01-10 00:59:44,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 225 transitions, 494 flow [2025-01-10 00:59:44,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 00:59:44,616 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;@745c8935, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 00:59:44,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2025-01-10 00:59:44,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 00:59:44,618 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-01-10 00:59:44,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 00:59:44,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 00:59:44,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-01-10 00:59:44,618 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2025-01-10 00:59:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 00:59:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash 28825, now seen corresponding path program 1 times [2025-01-10 00:59:44,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 00:59:44,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230214398] [2025-01-10 00:59:44,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 00:59:44,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 00:59:44,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 00:59:44,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 00:59:44,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 00:59:44,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 00:59:44,659 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:44,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 00:59:44,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230214398] [2025-01-10 00:59:44,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230214398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 00:59:44,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 00:59:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 00:59:44,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788824207] [2025-01-10 00:59:44,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 00:59:44,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 00:59:44,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 00:59:44,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 00:59:44,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 00:59:44,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 225 [2025-01-10 00:59:44,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 225 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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:44,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 00:59:44,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 225 [2025-01-10 00:59:44,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand