./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:14:11,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:14:11,076 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:14:11,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:14:11,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:14:11,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:14:11,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:14:11,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:14:11,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:14:11,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:14:11,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:14:11,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:14:11,105 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:14:11,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:14:11,105 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:14:11,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:14:11,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:14:11,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:14:11,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:14:11,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:14:11,107 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/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 ! call(reach_error())) ) 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 -> 6aeaf730cbe4eb831d189bfd9925d1660c7714b9e685f389bc2495c0943d6472 [2025-03-04 02:14:11,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:14:11,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:14:11,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:14:11,351 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:14:11,351 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:14:11,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 02:14:12,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aafc5728/7159e8c6a2b2453ca3233f4c6e9394b6/FLAG2c1cd38c5 [2025-03-04 02:14:12,615 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-04 02:14:12,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:14:12,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 02:14:12,887 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aafc5728/7159e8c6a2b2453ca3233f4c6e9394b6/FLAG2c1cd38c5 [2025-03-04 02:14:12,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aafc5728/7159e8c6a2b2453ca3233f4c6e9394b6 [2025-03-04 02:14:12,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:14:12,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:14:12,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:14:12,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:14:12,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:14:12,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:14:12" (1/1) ... [2025-03-04 02:14:12,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5989a0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:12, skipping insertion in model container [2025-03-04 02:14:12,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:14:12" (1/1) ... [2025-03-04 02:14:12,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:14:13,072 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-04 02:14:13,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:14:13,217 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:14:13,226 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-03-04 02:14:13,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:14:13,286 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:14:13,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13 WrapperNode [2025-03-04 02:14:13,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:14:13,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:14:13,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:14:13,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:14:13,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,325 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-03-04 02:14:13,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:14:13,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:14:13,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:14:13,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:14:13,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,349 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-03-04 02:14:13,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:14:13,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:14:13,368 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:14:13,368 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:14:13,369 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (1/1) ... [2025-03-04 02:14:13,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:14:13,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:14:13,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:14:13,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:14:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 02:14:13,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 02:14:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-03-04 02:14:13,421 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-03-04 02:14:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 02:14:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 02:14:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:14:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:14:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:14:13,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:14:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:14:13,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:14:13,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:14:13,423 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:14:13,527 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:14:13,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:14:13,730 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:14:13,730 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:14:13,877 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:14:13,877 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:14:13,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:14:13 BoogieIcfgContainer [2025-03-04 02:14:13,878 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:14:13,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:14:13,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:14:13,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:14:13,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:14:12" (1/3) ... [2025-03-04 02:14:13,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cc7297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:14:13, skipping insertion in model container [2025-03-04 02:14:13,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:14:13" (2/3) ... [2025-03-04 02:14:13,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18cc7297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:14:13, skipping insertion in model container [2025-03-04 02:14:13,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:14:13" (3/3) ... [2025-03-04 02:14:13,887 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-03-04 02:14:13,899 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:14:13,900 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 31 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2025-03-04 02:14:13,900 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:14:13,940 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 02:14:13,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 78 flow [2025-03-04 02:14:13,990 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2025-03-04 02:14:13,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:14:13,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 36 events. 7/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-04 02:14:13,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 37 transitions, 78 flow [2025-03-04 02:14:14,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 36 transitions, 75 flow [2025-03-04 02:14:14,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:14:14,019 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=LoopHeads, 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;@7b610433, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:14:14,021 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-04 02:14:14,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:14:14,029 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2025-03-04 02:14:14,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:14:14,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:14,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:14,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:14,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:14,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2102816857, now seen corresponding path program 1 times [2025-03-04 02:14:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371803463] [2025-03-04 02:14:14,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:14,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:14,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:14:14,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:14:14,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:14,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:14,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371803463] [2025-03-04 02:14:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371803463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:14,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:14,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:14:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871031350] [2025-03-04 02:14:14,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:14,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:14:14,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:14,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:14:14,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:14:14,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2025-03-04 02:14:14,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03-04 02:14:14,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:14,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2025-03-04 02:14:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:14,724 INFO L124 PetriNetUnfolderBase]: 218/450 cut-off events. [2025-03-04 02:14:14,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:14:14,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 450 events. 218/450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1930 event pairs, 20 based on Foata normal form. 37/407 useless extension candidates. Maximal degree in co-relation 851. Up to 241 conditions per place. [2025-03-04 02:14:14,735 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 47 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2025-03-04 02:14:14,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 69 transitions, 265 flow [2025-03-04 02:14:14,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:14:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:14:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-03-04 02:14:14,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536036036036036 [2025-03-04 02:14:14,751 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 75 flow. Second operand 6 states and 119 transitions. [2025-03-04 02:14:14,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 69 transitions, 265 flow [2025-03-04 02:14:14,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 69 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:14:14,758 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 168 flow [2025-03-04 02:14:14,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2025-03-04 02:14:14,764 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-04 02:14:14,764 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 168 flow [2025-03-04 02:14:14,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-03-04 02:14:14,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:14,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:14,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:14:14,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:14,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:14,766 INFO L85 PathProgramCache]: Analyzing trace with hash 762782622, now seen corresponding path program 1 times [2025-03-04 02:14:14,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:14,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532921610] [2025-03-04 02:14:14,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:14,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:14:14,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:14:14,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:14,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:14,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:14,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532921610] [2025-03-04 02:14:14,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532921610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:14,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:14,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:14:14,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70195152] [2025-03-04 02:14:14,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:14,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:14:14,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:14,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:14:14,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:14:14,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 02:14:14,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-03-04 02:14:14,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:14,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 02:14:14,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:15,116 INFO L124 PetriNetUnfolderBase]: 279/560 cut-off events. [2025-03-04 02:14:15,116 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2025-03-04 02:14:15,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 560 events. 279/560 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2496 event pairs, 55 based on Foata normal form. 20/539 useless extension candidates. Maximal degree in co-relation 1387. Up to 304 conditions per place. [2025-03-04 02:14:15,124 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 58 selfloop transitions, 25 changer transitions 0/89 dead transitions. [2025-03-04 02:14:15,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 89 transitions, 474 flow [2025-03-04 02:14:15,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:14:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:14:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2025-03-04 02:14:15,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-03-04 02:14:15,129 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 168 flow. Second operand 6 states and 108 transitions. [2025-03-04 02:14:15,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 89 transitions, 474 flow [2025-03-04 02:14:15,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:14:15,134 INFO L231 Difference]: Finished difference. Result has 51 places, 60 transitions, 366 flow [2025-03-04 02:14:15,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=51, PETRI_TRANSITIONS=60} [2025-03-04 02:14:15,134 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2025-03-04 02:14:15,134 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 60 transitions, 366 flow [2025-03-04 02:14:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-03-04 02:14:15,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:15,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:14:15,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1739179151, now seen corresponding path program 1 times [2025-03-04 02:14:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023752551] [2025-03-04 02:14:15,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:15,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:14:15,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:14:15,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:15,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:15,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:15,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023752551] [2025-03-04 02:14:15,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023752551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:15,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 02:14:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817575805] [2025-03-04 02:14:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:15,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 02:14:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:15,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 02:14:15,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 02:14:15,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 02:14:15,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 60 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-03-04 02:14:15,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:15,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 02:14:15,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:15,649 INFO L124 PetriNetUnfolderBase]: 399/859 cut-off events. [2025-03-04 02:14:15,649 INFO L125 PetriNetUnfolderBase]: For 1252/1269 co-relation queries the response was YES. [2025-03-04 02:14:15,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2742 conditions, 859 events. 399/859 cut-off events. For 1252/1269 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4770 event pairs, 87 based on Foata normal form. 16/820 useless extension candidates. Maximal degree in co-relation 2722. Up to 360 conditions per place. [2025-03-04 02:14:15,656 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 87 selfloop transitions, 27 changer transitions 0/127 dead transitions. [2025-03-04 02:14:15,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 127 transitions, 942 flow [2025-03-04 02:14:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:14:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:14:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2025-03-04 02:14:15,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6138996138996139 [2025-03-04 02:14:15,660 INFO L175 Difference]: Start difference. First operand has 51 places, 60 transitions, 366 flow. Second operand 7 states and 159 transitions. [2025-03-04 02:14:15,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 127 transitions, 942 flow [2025-03-04 02:14:15,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 942 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 02:14:15,674 INFO L231 Difference]: Finished difference. Result has 60 places, 76 transitions, 588 flow [2025-03-04 02:14:15,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=60, PETRI_TRANSITIONS=76} [2025-03-04 02:14:15,675 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2025-03-04 02:14:15,675 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 76 transitions, 588 flow [2025-03-04 02:14:15,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 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-03-04 02:14:15,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:15,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:15,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:14:15,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:15,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:15,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2038094019, now seen corresponding path program 2 times [2025-03-04 02:14:15,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:15,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678136079] [2025-03-04 02:14:15,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:14:15,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:15,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:14:15,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:14:15,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:14:15,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:15,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:15,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678136079] [2025-03-04 02:14:15,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678136079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:15,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:15,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:14:15,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340638096] [2025-03-04 02:14:15,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:14:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:15,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:14:15,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:14:15,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-04 02:14:15,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 76 transitions, 588 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 02:14:15,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:15,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-04 02:14:15,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:16,042 INFO L124 PetriNetUnfolderBase]: 430/919 cut-off events. [2025-03-04 02:14:16,042 INFO L125 PetriNetUnfolderBase]: For 2139/2183 co-relation queries the response was YES. [2025-03-04 02:14:16,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 919 events. 430/919 cut-off events. For 2139/2183 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4983 event pairs, 48 based on Foata normal form. 34/953 useless extension candidates. Maximal degree in co-relation 3328. Up to 311 conditions per place. [2025-03-04 02:14:16,049 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 131 selfloop transitions, 10 changer transitions 0/156 dead transitions. [2025-03-04 02:14:16,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 156 transitions, 1540 flow [2025-03-04 02:14:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:14:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:14:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-04 02:14:16,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-04 02:14:16,050 INFO L175 Difference]: Start difference. First operand has 60 places, 76 transitions, 588 flow. Second operand 5 states and 110 transitions. [2025-03-04 02:14:16,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 156 transitions, 1540 flow [2025-03-04 02:14:16,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 156 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:14:16,059 INFO L231 Difference]: Finished difference. Result has 64 places, 82 transitions, 630 flow [2025-03-04 02:14:16,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=630, PETRI_PLACES=64, PETRI_TRANSITIONS=82} [2025-03-04 02:14:16,059 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2025-03-04 02:14:16,059 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 82 transitions, 630 flow [2025-03-04 02:14:16,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 02:14:16,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:16,060 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:16,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:14:16,060 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:16,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1142161717, now seen corresponding path program 3 times [2025-03-04 02:14:16,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:16,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047887956] [2025-03-04 02:14:16,061 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:14:16,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:16,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:14:16,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:14:16,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:14:16,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:16,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047887956] [2025-03-04 02:14:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047887956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:16,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:14:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678513053] [2025-03-04 02:14:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:16,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:14:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:16,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:14:16,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:14:16,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-04 02:14:16,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 82 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-03-04 02:14:16,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:16,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-04 02:14:16,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:16,556 INFO L124 PetriNetUnfolderBase]: 559/1195 cut-off events. [2025-03-04 02:14:16,557 INFO L125 PetriNetUnfolderBase]: For 2941/2991 co-relation queries the response was YES. [2025-03-04 02:14:16,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 1195 events. 559/1195 cut-off events. For 2941/2991 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7139 event pairs, 24 based on Foata normal form. 50/1241 useless extension candidates. Maximal degree in co-relation 4773. Up to 597 conditions per place. [2025-03-04 02:14:16,567 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 106 selfloop transitions, 22 changer transitions 0/143 dead transitions. [2025-03-04 02:14:16,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1316 flow [2025-03-04 02:14:16,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:14:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:14:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2025-03-04 02:14:16,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-04 02:14:16,570 INFO L175 Difference]: Start difference. First operand has 64 places, 82 transitions, 630 flow. Second operand 6 states and 126 transitions. [2025-03-04 02:14:16,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1316 flow [2025-03-04 02:14:16,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 143 transitions, 1308 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:14:16,584 INFO L231 Difference]: Finished difference. Result has 70 places, 92 transitions, 748 flow [2025-03-04 02:14:16,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=70, PETRI_TRANSITIONS=92} [2025-03-04 02:14:16,585 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2025-03-04 02:14:16,586 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 92 transitions, 748 flow [2025-03-04 02:14:16,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-03-04 02:14:16,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:16,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:16,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:14:16,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:16,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash 364367759, now seen corresponding path program 4 times [2025-03-04 02:14:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484279832] [2025-03-04 02:14:16,587 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:14:16,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:16,598 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-03-04 02:14:16,602 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 14 statements. [2025-03-04 02:14:16,602 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 02:14:16,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:16,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:16,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484279832] [2025-03-04 02:14:16,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484279832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:16,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:16,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:14:16,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612439999] [2025-03-04 02:14:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:16,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:14:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:16,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:14:16,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:14:16,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-04 02:14:16,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 92 transitions, 748 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 02:14:16,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:16,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-04 02:14:16,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:16,921 INFO L124 PetriNetUnfolderBase]: 591/1283 cut-off events. [2025-03-04 02:14:16,922 INFO L125 PetriNetUnfolderBase]: For 4024/4088 co-relation queries the response was YES. [2025-03-04 02:14:16,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5541 conditions, 1283 events. 591/1283 cut-off events. For 4024/4088 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7491 event pairs, 19 based on Foata normal form. 57/1339 useless extension candidates. Maximal degree in co-relation 5512. Up to 435 conditions per place. [2025-03-04 02:14:16,932 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 163 selfloop transitions, 35 changer transitions 0/213 dead transitions. [2025-03-04 02:14:16,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 213 transitions, 2122 flow [2025-03-04 02:14:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 02:14:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 02:14:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2025-03-04 02:14:16,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640926640926641 [2025-03-04 02:14:16,934 INFO L175 Difference]: Start difference. First operand has 70 places, 92 transitions, 748 flow. Second operand 7 states and 172 transitions. [2025-03-04 02:14:16,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 213 transitions, 2122 flow [2025-03-04 02:14:16,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 213 transitions, 2094 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 02:14:16,946 INFO L231 Difference]: Finished difference. Result has 77 places, 111 transitions, 1016 flow [2025-03-04 02:14:16,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1016, PETRI_PLACES=77, PETRI_TRANSITIONS=111} [2025-03-04 02:14:16,947 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2025-03-04 02:14:16,947 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 111 transitions, 1016 flow [2025-03-04 02:14:16,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 02:14:16,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:16,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:16,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:14:16,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:16,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash 926405535, now seen corresponding path program 5 times [2025-03-04 02:14:16,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:16,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250176371] [2025-03-04 02:14:16,949 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:14:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:16,956 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-03-04 02:14:16,962 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 02:14:16,964 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:14:16,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:17,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250176371] [2025-03-04 02:14:17,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250176371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:17,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:17,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:14:17,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294079129] [2025-03-04 02:14:17,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:17,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:14:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:17,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:14:17,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:14:17,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2025-03-04 02:14:17,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 111 transitions, 1016 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 02:14:17,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:17,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2025-03-04 02:14:17,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:17,220 INFO L124 PetriNetUnfolderBase]: 188/497 cut-off events. [2025-03-04 02:14:17,220 INFO L125 PetriNetUnfolderBase]: For 2616/2632 co-relation queries the response was YES. [2025-03-04 02:14:17,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 497 events. 188/497 cut-off events. For 2616/2632 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2539 event pairs, 9 based on Foata normal form. 27/523 useless extension candidates. Maximal degree in co-relation 2322. Up to 213 conditions per place. [2025-03-04 02:14:17,223 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 72 selfloop transitions, 38 changer transitions 0/122 dead transitions. [2025-03-04 02:14:17,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 1349 flow [2025-03-04 02:14:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:14:17,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:14:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-03-04 02:14:17,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2025-03-04 02:14:17,227 INFO L175 Difference]: Start difference. First operand has 77 places, 111 transitions, 1016 flow. Second operand 5 states and 116 transitions. [2025-03-04 02:14:17,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 1349 flow [2025-03-04 02:14:17,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 1126 flow, removed 28 selfloop flow, removed 10 redundant places. [2025-03-04 02:14:17,236 INFO L231 Difference]: Finished difference. Result has 72 places, 92 transitions, 852 flow [2025-03-04 02:14:17,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=852, PETRI_PLACES=72, PETRI_TRANSITIONS=92} [2025-03-04 02:14:17,237 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places. [2025-03-04 02:14:17,237 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 92 transitions, 852 flow [2025-03-04 02:14:17,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-03-04 02:14:17,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:17,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:17,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:14:17,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1156186700, now seen corresponding path program 1 times [2025-03-04 02:14:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553189965] [2025-03-04 02:14:17,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:17,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:17,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:14:17,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:14:17,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:17,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553189965] [2025-03-04 02:14:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553189965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:14:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082765050] [2025-03-04 02:14:17,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:17,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:14:17,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:17,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:14:17,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:14:17,439 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 02:14:17,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 92 transitions, 852 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-03-04 02:14:17,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:17,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 02:14:17,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:17,697 INFO L124 PetriNetUnfolderBase]: 274/670 cut-off events. [2025-03-04 02:14:17,697 INFO L125 PetriNetUnfolderBase]: For 2893/2920 co-relation queries the response was YES. [2025-03-04 02:14:17,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3145 conditions, 670 events. 274/670 cut-off events. For 2893/2920 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3587 event pairs, 30 based on Foata normal form. 16/686 useless extension candidates. Maximal degree in co-relation 3114. Up to 359 conditions per place. [2025-03-04 02:14:17,701 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 144 selfloop transitions, 37 changer transitions 0/191 dead transitions. [2025-03-04 02:14:17,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 191 transitions, 2015 flow [2025-03-04 02:14:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:14:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:14:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-03-04 02:14:17,702 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5885885885885885 [2025-03-04 02:14:17,702 INFO L175 Difference]: Start difference. First operand has 72 places, 92 transitions, 852 flow. Second operand 9 states and 196 transitions. [2025-03-04 02:14:17,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 191 transitions, 2015 flow [2025-03-04 02:14:17,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 191 transitions, 1886 flow, removed 29 selfloop flow, removed 2 redundant places. [2025-03-04 02:14:17,711 INFO L231 Difference]: Finished difference. Result has 84 places, 119 transitions, 1186 flow [2025-03-04 02:14:17,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1186, PETRI_PLACES=84, PETRI_TRANSITIONS=119} [2025-03-04 02:14:17,712 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2025-03-04 02:14:17,712 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 119 transitions, 1186 flow [2025-03-04 02:14:17,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-03-04 02:14:17,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:17,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:17,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:14:17,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:17,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2105617716, now seen corresponding path program 2 times [2025-03-04 02:14:17,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:17,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-03-04 02:14:17,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:14:17,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:17,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:14:17,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:14:17,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:14:17,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:17,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:17,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:17,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300340037] [2025-03-04 02:14:17,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300340037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:17,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:17,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:14:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595692407] [2025-03-04 02:14:17,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:17,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:14:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:17,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:14:17,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:14:17,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 02:14:17,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 119 transitions, 1186 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-03-04 02:14:17,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:17,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 02:14:17,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:18,196 INFO L124 PetriNetUnfolderBase]: 308/780 cut-off events. [2025-03-04 02:14:18,197 INFO L125 PetriNetUnfolderBase]: For 4024/4052 co-relation queries the response was YES. [2025-03-04 02:14:18,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3768 conditions, 780 events. 308/780 cut-off events. For 4024/4052 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4397 event pairs, 71 based on Foata normal form. 14/794 useless extension candidates. Maximal degree in co-relation 3731. Up to 472 conditions per place. [2025-03-04 02:14:18,202 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 147 selfloop transitions, 34 changer transitions 0/191 dead transitions. [2025-03-04 02:14:18,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 191 transitions, 2129 flow [2025-03-04 02:14:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 02:14:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 02:14:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions. [2025-03-04 02:14:18,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855855855855856 [2025-03-04 02:14:18,204 INFO L175 Difference]: Start difference. First operand has 84 places, 119 transitions, 1186 flow. Second operand 9 states and 195 transitions. [2025-03-04 02:14:18,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 191 transitions, 2129 flow [2025-03-04 02:14:18,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 191 transitions, 2075 flow, removed 27 selfloop flow, removed 0 redundant places. [2025-03-04 02:14:18,216 INFO L231 Difference]: Finished difference. Result has 96 places, 134 transitions, 1440 flow [2025-03-04 02:14:18,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1440, PETRI_PLACES=96, PETRI_TRANSITIONS=134} [2025-03-04 02:14:18,217 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2025-03-04 02:14:18,217 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 134 transitions, 1440 flow [2025-03-04 02:14:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-03-04 02:14:18,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:18,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:18,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 02:14:18,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:18,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1719994451, now seen corresponding path program 1 times [2025-03-04 02:14:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136721804] [2025-03-04 02:14:18,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:18,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:14:18,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:14:18,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:18,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:18,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136721804] [2025-03-04 02:14:18,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136721804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:18,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:18,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 02:14:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077683538] [2025-03-04 02:14:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:18,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:14:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:18,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:14:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:14:18,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 02:14:18,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 134 transitions, 1440 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-03-04 02:14:18,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:18,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 02:14:18,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:18,713 INFO L124 PetriNetUnfolderBase]: 367/925 cut-off events. [2025-03-04 02:14:18,714 INFO L125 PetriNetUnfolderBase]: For 5863/5889 co-relation queries the response was YES. [2025-03-04 02:14:18,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4715 conditions, 925 events. 367/925 cut-off events. For 5863/5889 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5175 event pairs, 40 based on Foata normal form. 26/951 useless extension candidates. Maximal degree in co-relation 4672. Up to 243 conditions per place. [2025-03-04 02:14:18,721 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 155 selfloop transitions, 79 changer transitions 0/244 dead transitions. [2025-03-04 02:14:18,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 244 transitions, 2878 flow [2025-03-04 02:14:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 02:14:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 02:14:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 216 transitions. [2025-03-04 02:14:18,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2025-03-04 02:14:18,723 INFO L175 Difference]: Start difference. First operand has 96 places, 134 transitions, 1440 flow. Second operand 10 states and 216 transitions. [2025-03-04 02:14:18,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 244 transitions, 2878 flow [2025-03-04 02:14:18,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 244 transitions, 2738 flow, removed 53 selfloop flow, removed 3 redundant places. [2025-03-04 02:14:18,739 INFO L231 Difference]: Finished difference. Result has 108 places, 173 transitions, 2129 flow [2025-03-04 02:14:18,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2129, PETRI_PLACES=108, PETRI_TRANSITIONS=173} [2025-03-04 02:14:18,740 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2025-03-04 02:14:18,740 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 173 transitions, 2129 flow [2025-03-04 02:14:18,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 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-03-04 02:14:18,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:18,740 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:18,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 02:14:18,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:18,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:18,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1904048939, now seen corresponding path program 1 times [2025-03-04 02:14:18,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:18,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209966133] [2025-03-04 02:14:18,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:18,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 02:14:18,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 02:14:18,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:18,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:18,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209966133] [2025-03-04 02:14:18,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209966133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:18,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:14:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625208736] [2025-03-04 02:14:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:18,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:14:18,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:18,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:14:18,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:14:18,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-03-04 02:14:18,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 173 transitions, 2129 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-03-04 02:14:18,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:18,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-03-04 02:14:18,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:18,964 INFO L124 PetriNetUnfolderBase]: 315/812 cut-off events. [2025-03-04 02:14:18,964 INFO L125 PetriNetUnfolderBase]: For 7297/7337 co-relation queries the response was YES. [2025-03-04 02:14:18,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4583 conditions, 812 events. 315/812 cut-off events. For 7297/7337 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4133 event pairs, 75 based on Foata normal form. 15/826 useless extension candidates. Maximal degree in co-relation 4534. Up to 657 conditions per place. [2025-03-04 02:14:18,970 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 144 selfloop transitions, 7 changer transitions 13/172 dead transitions. [2025-03-04 02:14:18,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 172 transitions, 2358 flow [2025-03-04 02:14:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:14:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:14:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-03-04 02:14:18,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-03-04 02:14:18,971 INFO L175 Difference]: Start difference. First operand has 108 places, 173 transitions, 2129 flow. Second operand 5 states and 95 transitions. [2025-03-04 02:14:18,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 172 transitions, 2358 flow [2025-03-04 02:14:18,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 172 transitions, 2179 flow, removed 80 selfloop flow, removed 3 redundant places. [2025-03-04 02:14:18,985 INFO L231 Difference]: Finished difference. Result has 111 places, 155 transitions, 1744 flow [2025-03-04 02:14:18,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1744, PETRI_PLACES=111, PETRI_TRANSITIONS=155} [2025-03-04 02:14:18,986 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 78 predicate places. [2025-03-04 02:14:18,986 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 155 transitions, 1744 flow [2025-03-04 02:14:18,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-03-04 02:14:18,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:18,986 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:18,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 02:14:18,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting workerErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr1ASSERT_VIOLATIONERROR_FUNCTION, workerErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-03-04 02:14:18,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:18,987 INFO L85 PathProgramCache]: Analyzing trace with hash 597874344, now seen corresponding path program 1 times [2025-03-04 02:14:18,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303395392] [2025-03-04 02:14:18,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:18,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:14:18,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:14:18,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:18,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:19,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303395392] [2025-03-04 02:14:19,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303395392] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:14:19,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941160051] [2025-03-04 02:14:19,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:14:19,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:14:19,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:14:19,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:14:19,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:14:19,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 02:14:19,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 02:14:19,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:14:19,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:19,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 02:14:19,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:14:19,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 02:14:19,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-04 02:14:19,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-04 02:14:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:19,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:14:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:14:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941160051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:14:21,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:14:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 30 [2025-03-04 02:14:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152015446] [2025-03-04 02:14:21,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:14:21,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 02:14:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:21,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 02:14:21,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=679, Unknown=0, NotChecked=0, Total=870 [2025-03-04 02:14:21,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2025-03-04 02:14:21,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 155 transitions, 1744 flow. Second operand has 30 states, 30 states have (on average 9.166666666666666) internal successors, (275), 30 states have internal predecessors, (275), 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-03-04 02:14:21,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:21,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2025-03-04 02:14:21,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:23,009 INFO L124 PetriNetUnfolderBase]: 547/1330 cut-off events. [2025-03-04 02:14:23,009 INFO L125 PetriNetUnfolderBase]: For 11355/11369 co-relation queries the response was YES. [2025-03-04 02:14:23,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7400 conditions, 1330 events. 547/1330 cut-off events. For 11355/11369 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7349 event pairs, 46 based on Foata normal form. 40/1370 useless extension candidates. Maximal degree in co-relation 7359. Up to 241 conditions per place. [2025-03-04 02:14:23,016 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 0 selfloop transitions, 0 changer transitions 416/416 dead transitions. [2025-03-04 02:14:23,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 416 transitions, 5360 flow [2025-03-04 02:14:23,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-04 02:14:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-04 02:14:23,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 397 transitions. [2025-03-04 02:14:23,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34612031386224934 [2025-03-04 02:14:23,018 INFO L175 Difference]: Start difference. First operand has 111 places, 155 transitions, 1744 flow. Second operand 31 states and 397 transitions. [2025-03-04 02:14:23,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 416 transitions, 5360 flow [2025-03-04 02:14:23,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 416 transitions, 5230 flow, removed 37 selfloop flow, removed 8 redundant places. [2025-03-04 02:14:23,045 INFO L231 Difference]: Finished difference. Result has 129 places, 0 transitions, 0 flow [2025-03-04 02:14:23,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1686, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=0, PETRI_PLACES=129, PETRI_TRANSITIONS=0} [2025-03-04 02:14:23,046 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 96 predicate places. [2025-03-04 02:14:23,046 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 0 transitions, 0 flow [2025-03-04 02:14:23,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.166666666666666) internal successors, (275), 30 states have internal predecessors, (275), 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-03-04 02:14:23,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-04 02:14:23,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-04 02:14:23,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-04 02:14:23,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-04 02:14:23,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-04 02:14:23,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:14:23,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 02:14:23,250 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2025-03-04 02:14:23,254 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:14:23,254 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:14:23,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:14:23 BasicIcfg [2025-03-04 02:14:23,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:14:23,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:14:23,258 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:14:23,258 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:14:23,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:14:13" (3/4) ... [2025-03-04 02:14:23,260 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:14:23,261 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure worker [2025-03-04 02:14:23,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2025-03-04 02:14:23,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 02:14:23,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 02:14:23,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:14:23,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 02:14:23,315 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:14:23,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:14:23,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:14:23,317 INFO L158 Benchmark]: Toolchain (without parser) took 10409.78ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 111.3MB in the beginning and 117.1MB in the end (delta: -5.8MB). Peak memory consumption was 140.5MB. Max. memory is 16.1GB. [2025-03-04 02:14:23,318 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:14:23,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.77ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 91.3MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 02:14:23,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.71ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:14:23,319 INFO L158 Benchmark]: Boogie Preprocessor took 41.50ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:14:23,319 INFO L158 Benchmark]: IcfgBuilder took 510.16ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 56.3MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:14:23,319 INFO L158 Benchmark]: TraceAbstraction took 9378.38ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 55.3MB in the beginning and 121.9MB in the end (delta: -66.5MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2025-03-04 02:14:23,319 INFO L158 Benchmark]: Witness Printer took 57.48ms. Allocated memory is still 293.6MB. Free memory was 121.9MB in the beginning and 117.1MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:14:23,321 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.77ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 91.3MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.71ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.50ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 87.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 510.16ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 56.3MB in the end (delta: 31.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9378.38ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 55.3MB in the beginning and 121.9MB in the end (delta: -66.5MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * Witness Printer took 57.48ms. Allocated memory is still 293.6MB. Free memory was 121.9MB in the beginning and 117.1MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 54 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 810 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 789 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2933 IncrementalHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 14 mSDtfsCounter, 2933 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 171 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2129occurred in iteration=10, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 213 NumberOfCodeBlocks, 211 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 226 ConstructedInterpolants, 12 QuantifiedInterpolants, 2529 SizeOfPredicates, 24 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 5/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:14:23,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE