./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_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_27-multiple-protecting2_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 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:13:49,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:13:49,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:13:49,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:13:49,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:13:49,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:13:49,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:13:49,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:13:49,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:13:49,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:13:49,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:13:49,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:13:49,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:13:49,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:13:49,496 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:13:49,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:13:49,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:13:49,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:13:49,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:13:49,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:13:49,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:13:49,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:13:49,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:13:49,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:13:49,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:13:49,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:13:49,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:13:49,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:13:49,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:13:49,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:13:49,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:13:49,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:13:49,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:13:49,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:13:49,499 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 -> 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 [2025-03-04 02:13:49,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:13:49,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:13:49,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:13:49,707 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:13:49,707 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:13:49,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-03-04 02:13:50,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef081ff1/b7142f8e150d4abda3df92eb0e600225/FLAG2d084f236 [2025-03-04 02:13:51,066 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:13:51,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-03-04 02:13:51,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef081ff1/b7142f8e150d4abda3df92eb0e600225/FLAG2d084f236 [2025-03-04 02:13:51,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ef081ff1/b7142f8e150d4abda3df92eb0e600225 [2025-03-04 02:13:51,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:13:51,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:13:51,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:13:51,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:13:51,400 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:13:51,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cafa9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51, skipping insertion in model container [2025-03-04 02:13:51,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:13:51,530 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_27-multiple-protecting2_true.i[1097,1110] [2025-03-04 02:13:51,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:13:51,624 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:13:51,630 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_27-multiple-protecting2_true.i[1097,1110] [2025-03-04 02:13:51,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:13:51,674 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:13:51,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51 WrapperNode [2025-03-04 02:13:51,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:13:51,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:13:51,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:13:51,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:13:51,681 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:13:51" (1/1) ... [2025-03-04 02:13:51,689 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:13:51" (1/1) ... [2025-03-04 02:13:51,703 INFO L138 Inliner]: procedures = 163, calls = 54, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 109 [2025-03-04 02:13:51,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:13:51,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:13:51,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:13:51,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:13:51,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,719 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-04 02:13:51,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,723 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,725 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:13:51,729 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:13:51,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:13:51,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:13:51,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (1/1) ... [2025-03-04 02:13:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:13:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:51,751 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:13:51,753 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:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-03-04 02:13:51,766 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-03-04 02:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 02:13:51,766 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 02:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 02:13:51,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 02:13:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:13:51,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:13:51,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:13:51,767 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:13:51,862 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:13:51,863 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:13:52,074 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:13:52,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:13:52,177 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:13:52,178 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:13:52,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:13:52 BoogieIcfgContainer [2025-03-04 02:13:52,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:13:52,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:13:52,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:13:52,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:13:52,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:13:51" (1/3) ... [2025-03-04 02:13:52,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398c93f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:13:52, skipping insertion in model container [2025-03-04 02:13:52,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:51" (2/3) ... [2025-03-04 02:13:52,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398c93f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:13:52, skipping insertion in model container [2025-03-04 02:13:52,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:13:52" (3/3) ... [2025-03-04 02:13:52,184 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-03-04 02:13:52,193 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:13:52,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 77 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 02:13:52,194 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:13:52,237 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 02:13:52,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 80 transitions, 174 flow [2025-03-04 02:13:52,302 INFO L124 PetriNetUnfolderBase]: 4/78 cut-off events. [2025-03-04 02:13:52,305 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 02:13:52,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 4/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2025-03-04 02:13:52,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 80 transitions, 174 flow [2025-03-04 02:13:52,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 68 transitions, 142 flow [2025-03-04 02:13:52,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:13:52,331 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;@50045cb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:13:52,331 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 02:13:52,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:13:52,338 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-03-04 02:13:52,338 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 02:13:52,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:52,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:52,339 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:52,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:52,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2096670443, now seen corresponding path program 1 times [2025-03-04 02:13:52,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:52,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761713499] [2025-03-04 02:13:52,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:52,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:52,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 02:13:52,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 02:13:52,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:52,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:52,621 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:13:52,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:52,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761713499] [2025-03-04 02:13:52,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761713499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:52,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:52,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:13:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174790993] [2025-03-04 02:13:52,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:52,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:13:52,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:52,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:13:52,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:13:52,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 80 [2025-03-04 02:13:52,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:13:52,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:52,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 80 [2025-03-04 02:13:52,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:53,407 INFO L124 PetriNetUnfolderBase]: 4727/8284 cut-off events. [2025-03-04 02:13:53,408 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 02:13:53,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15778 conditions, 8284 events. 4727/8284 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 56923 event pairs, 1134 based on Foata normal form. 340/8374 useless extension candidates. Maximal degree in co-relation 15768. Up to 4568 conditions per place. [2025-03-04 02:13:53,456 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 93 selfloop transitions, 15 changer transitions 1/127 dead transitions. [2025-03-04 02:13:53,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 127 transitions, 481 flow [2025-03-04 02:13:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:13:53,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:13:53,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 229 transitions. [2025-03-04 02:13:53,467 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5725 [2025-03-04 02:13:53,468 INFO L175 Difference]: Start difference. First operand has 72 places, 68 transitions, 142 flow. Second operand 5 states and 229 transitions. [2025-03-04 02:13:53,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 127 transitions, 481 flow [2025-03-04 02:13:53,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:13:53,478 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 234 flow [2025-03-04 02:13:53,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-03-04 02:13:53,482 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 6 predicate places. [2025-03-04 02:13:53,483 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 234 flow [2025-03-04 02:13:53,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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:13:53,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:53,484 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:13:53,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:13:53,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:53,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2002097257, now seen corresponding path program 1 times [2025-03-04 02:13:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618904932] [2025-03-04 02:13:53,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:53,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:53,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 02:13:53,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 02:13:53,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:53,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:53,653 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:13:53,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:53,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618904932] [2025-03-04 02:13:53,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618904932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:53,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:53,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:13:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767465115] [2025-03-04 02:13:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:53,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:13:53,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:53,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:13:53,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:13:53,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 80 [2025-03-04 02:13:53,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:13:53,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:53,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 80 [2025-03-04 02:13:53,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:54,034 INFO L124 PetriNetUnfolderBase]: 1727/3844 cut-off events. [2025-03-04 02:13:54,035 INFO L125 PetriNetUnfolderBase]: For 730/758 co-relation queries the response was YES. [2025-03-04 02:13:54,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8070 conditions, 3844 events. 1727/3844 cut-off events. For 730/758 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 26790 event pairs, 443 based on Foata normal form. 210/4044 useless extension candidates. Maximal degree in co-relation 8056. Up to 2236 conditions per place. [2025-03-04 02:13:54,055 INFO L140 encePairwiseOnDemand]: 74/80 looper letters, 81 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2025-03-04 02:13:54,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 115 transitions, 534 flow [2025-03-04 02:13:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:13:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:13:54,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-03-04 02:13:54,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61875 [2025-03-04 02:13:54,060 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 234 flow. Second operand 4 states and 198 transitions. [2025-03-04 02:13:54,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 115 transitions, 534 flow [2025-03-04 02:13:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 530 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 02:13:54,077 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 259 flow [2025-03-04 02:13:54,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-04 02:13:54,078 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 10 predicate places. [2025-03-04 02:13:54,078 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 259 flow [2025-03-04 02:13:54,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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:13:54,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:54,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:54,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:13:54,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1118134833, now seen corresponding path program 1 times [2025-03-04 02:13:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464886903] [2025-03-04 02:13:54,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:54,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:54,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 02:13:54,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 02:13:54,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:54,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:54,225 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:13:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464886903] [2025-03-04 02:13:54,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464886903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:54,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:54,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:13:54,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893293645] [2025-03-04 02:13:54,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:54,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:13:54,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:54,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:13:54,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:13:54,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 80 [2025-03-04 02:13:54,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:13:54,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:54,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 80 [2025-03-04 02:13:54,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:54,697 INFO L124 PetriNetUnfolderBase]: 2209/4345 cut-off events. [2025-03-04 02:13:54,697 INFO L125 PetriNetUnfolderBase]: For 1266/1266 co-relation queries the response was YES. [2025-03-04 02:13:54,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9984 conditions, 4345 events. 2209/4345 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 28118 event pairs, 1239 based on Foata normal form. 100/4433 useless extension candidates. Maximal degree in co-relation 9967. Up to 2338 conditions per place. [2025-03-04 02:13:54,712 INFO L140 encePairwiseOnDemand]: 65/80 looper letters, 91 selfloop transitions, 23 changer transitions 5/137 dead transitions. [2025-03-04 02:13:54,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 137 transitions, 691 flow [2025-03-04 02:13:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:13:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:13:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 241 transitions. [2025-03-04 02:13:54,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5020833333333333 [2025-03-04 02:13:54,713 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 259 flow. Second operand 6 states and 241 transitions. [2025-03-04 02:13:54,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 137 transitions, 691 flow [2025-03-04 02:13:54,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 137 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:13:54,719 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 395 flow [2025-03-04 02:13:54,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=395, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2025-03-04 02:13:54,720 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2025-03-04 02:13:54,720 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 395 flow [2025-03-04 02:13:54,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 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:13:54,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:54,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:54,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:13:54,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:54,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:54,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1012863408, now seen corresponding path program 1 times [2025-03-04 02:13:54,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:54,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916952564] [2025-03-04 02:13:54,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:54,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:54,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 02:13:54,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 02:13:54,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:54,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:54,795 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:13:54,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:54,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916952564] [2025-03-04 02:13:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916952564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:54,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:54,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:13:54,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987206704] [2025-03-04 02:13:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:54,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:13:54,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:54,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:13:54,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:13:54,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 80 [2025-03-04 02:13:54,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 395 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:13:54,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:54,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 80 [2025-03-04 02:13:54,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:55,158 INFO L124 PetriNetUnfolderBase]: 2035/4102 cut-off events. [2025-03-04 02:13:55,159 INFO L125 PetriNetUnfolderBase]: For 2950/2950 co-relation queries the response was YES. [2025-03-04 02:13:55,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10326 conditions, 4102 events. 2035/4102 cut-off events. For 2950/2950 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 26786 event pairs, 608 based on Foata normal form. 44/4141 useless extension candidates. Maximal degree in co-relation 10306. Up to 2599 conditions per place. [2025-03-04 02:13:55,178 INFO L140 encePairwiseOnDemand]: 70/80 looper letters, 96 selfloop transitions, 31 changer transitions 1/146 dead transitions. [2025-03-04 02:13:55,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 146 transitions, 934 flow [2025-03-04 02:13:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:13:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:13:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2025-03-04 02:13:55,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-03-04 02:13:55,179 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 395 flow. Second operand 5 states and 210 transitions. [2025-03-04 02:13:55,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 146 transitions, 934 flow [2025-03-04 02:13:55,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 146 transitions, 902 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 02:13:55,188 INFO L231 Difference]: Finished difference. Result has 94 places, 99 transitions, 601 flow [2025-03-04 02:13:55,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=601, PETRI_PLACES=94, PETRI_TRANSITIONS=99} [2025-03-04 02:13:55,190 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2025-03-04 02:13:55,190 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 99 transitions, 601 flow [2025-03-04 02:13:55,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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:13:55,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:55,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:55,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:13:55,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 854346895, now seen corresponding path program 1 times [2025-03-04 02:13:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:55,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371898500] [2025-03-04 02:13:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:55,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 02:13:55,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 02:13:55,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:55,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:55,305 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:13:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:55,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371898500] [2025-03-04 02:13:55,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371898500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:55,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:55,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:13:55,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415045476] [2025-03-04 02:13:55,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:55,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:13:55,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:55,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:13:55,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:13:55,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 80 [2025-03-04 02:13:55,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 99 transitions, 601 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:13:55,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:55,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 80 [2025-03-04 02:13:55,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:55,517 INFO L124 PetriNetUnfolderBase]: 1075/2454 cut-off events. [2025-03-04 02:13:55,517 INFO L125 PetriNetUnfolderBase]: For 2172/2184 co-relation queries the response was YES. [2025-03-04 02:13:55,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 2454 events. 1075/2454 cut-off events. For 2172/2184 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 15656 event pairs, 363 based on Foata normal form. 288/2691 useless extension candidates. Maximal degree in co-relation 6822. Up to 1214 conditions per place. [2025-03-04 02:13:55,526 INFO L140 encePairwiseOnDemand]: 63/80 looper letters, 65 selfloop transitions, 17 changer transitions 2/119 dead transitions. [2025-03-04 02:13:55,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 119 transitions, 831 flow [2025-03-04 02:13:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:13:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:13:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-03-04 02:13:55,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596875 [2025-03-04 02:13:55,527 INFO L175 Difference]: Start difference. First operand has 94 places, 99 transitions, 601 flow. Second operand 4 states and 191 transitions. [2025-03-04 02:13:55,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 119 transitions, 831 flow [2025-03-04 02:13:55,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 811 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:13:55,537 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 607 flow [2025-03-04 02:13:55,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=607, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2025-03-04 02:13:55,537 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 25 predicate places. [2025-03-04 02:13:55,537 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 607 flow [2025-03-04 02:13:55,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 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:13:55,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:55,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:55,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:13:55,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:55,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1505455852, now seen corresponding path program 1 times [2025-03-04 02:13:55,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:55,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044091003] [2025-03-04 02:13:55,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:55,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:55,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 02:13:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 02:13:55,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:55,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:55,794 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:13:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044091003] [2025-03-04 02:13:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044091003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:55,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:13:55,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337469068] [2025-03-04 02:13:55,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:55,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:13:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:55,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:13:55,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:13:55,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 80 [2025-03-04 02:13:55,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 607 flow. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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:13:55,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:55,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 80 [2025-03-04 02:13:55,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:55,993 INFO L124 PetriNetUnfolderBase]: 790/1941 cut-off events. [2025-03-04 02:13:55,994 INFO L125 PetriNetUnfolderBase]: For 2171/2176 co-relation queries the response was YES. [2025-03-04 02:13:55,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5923 conditions, 1941 events. 790/1941 cut-off events. For 2171/2176 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 11891 event pairs, 223 based on Foata normal form. 62/1998 useless extension candidates. Maximal degree in co-relation 5897. Up to 1397 conditions per place. [2025-03-04 02:13:56,001 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 59 selfloop transitions, 6 changer transitions 11/99 dead transitions. [2025-03-04 02:13:56,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 99 transitions, 713 flow [2025-03-04 02:13:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:13:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:13:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2025-03-04 02:13:56,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54375 [2025-03-04 02:13:56,003 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 607 flow. Second operand 4 states and 174 transitions. [2025-03-04 02:13:56,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 99 transitions, 713 flow [2025-03-04 02:13:56,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 99 transitions, 632 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-03-04 02:13:56,009 INFO L231 Difference]: Finished difference. Result has 86 places, 74 transitions, 390 flow [2025-03-04 02:13:56,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=86, PETRI_TRANSITIONS=74} [2025-03-04 02:13:56,010 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 14 predicate places. [2025-03-04 02:13:56,010 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 74 transitions, 390 flow [2025-03-04 02:13:56,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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:13:56,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:56,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:56,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:13:56,011 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:56,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash 889471855, now seen corresponding path program 1 times [2025-03-04 02:13:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777473291] [2025-03-04 02:13:56,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:56,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 02:13:56,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 02:13:56,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:56,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:56,188 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:13:56,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:56,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777473291] [2025-03-04 02:13:56,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777473291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:56,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:56,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:13:56,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520704030] [2025-03-04 02:13:56,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 02:13:56,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:56,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 02:13:56,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 02:13:56,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 80 [2025-03-04 02:13:56,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 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:13:56,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:56,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 80 [2025-03-04 02:13:56,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:56,325 INFO L124 PetriNetUnfolderBase]: 537/1307 cut-off events. [2025-03-04 02:13:56,325 INFO L125 PetriNetUnfolderBase]: For 1276/1276 co-relation queries the response was YES. [2025-03-04 02:13:56,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3736 conditions, 1307 events. 537/1307 cut-off events. For 1276/1276 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7010 event pairs, 215 based on Foata normal form. 47/1353 useless extension candidates. Maximal degree in co-relation 3712. Up to 691 conditions per place. [2025-03-04 02:13:56,329 INFO L140 encePairwiseOnDemand]: 76/80 looper letters, 64 selfloop transitions, 5 changer transitions 4/94 dead transitions. [2025-03-04 02:13:56,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 94 transitions, 644 flow [2025-03-04 02:13:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:13:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:13:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2025-03-04 02:13:56,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.540625 [2025-03-04 02:13:56,330 INFO L175 Difference]: Start difference. First operand has 86 places, 74 transitions, 390 flow. Second operand 4 states and 173 transitions. [2025-03-04 02:13:56,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 94 transitions, 644 flow [2025-03-04 02:13:56,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 586 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 02:13:56,334 INFO L231 Difference]: Finished difference. Result has 77 places, 69 transitions, 319 flow [2025-03-04 02:13:56,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=319, PETRI_PLACES=77, PETRI_TRANSITIONS=69} [2025-03-04 02:13:56,336 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2025-03-04 02:13:56,336 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 69 transitions, 319 flow [2025-03-04 02:13:56,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 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:13:56,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:56,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:56,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 02:13:56,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-03-04 02:13:56,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:56,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1373061322, now seen corresponding path program 1 times [2025-03-04 02:13:56,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:56,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344284356] [2025-03-04 02:13:56,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:56,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 02:13:56,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 02:13:56,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:56,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:56,447 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:13:56,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:56,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344284356] [2025-03-04 02:13:56,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344284356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:56,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:56,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:13:56,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179934006] [2025-03-04 02:13:56,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:56,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:13:56,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:56,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:13:56,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:13:56,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 80 [2025-03-04 02:13:56,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 69 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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:13:56,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:56,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 80 [2025-03-04 02:13:56,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:56,639 INFO L124 PetriNetUnfolderBase]: 586/1296 cut-off events. [2025-03-04 02:13:56,639 INFO L125 PetriNetUnfolderBase]: For 942/942 co-relation queries the response was YES. [2025-03-04 02:13:56,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 1296 events. 586/1296 cut-off events. For 942/942 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 6703 event pairs, 368 based on Foata normal form. 12/1301 useless extension candidates. Maximal degree in co-relation 3656. Up to 827 conditions per place. [2025-03-04 02:13:56,641 INFO L140 encePairwiseOnDemand]: 71/80 looper letters, 0 selfloop transitions, 0 changer transitions 97/97 dead transitions. [2025-03-04 02:13:56,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 97 transitions, 625 flow [2025-03-04 02:13:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:13:56,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:13:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 197 transitions. [2025-03-04 02:13:56,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41041666666666665 [2025-03-04 02:13:56,643 INFO L175 Difference]: Start difference. First operand has 77 places, 69 transitions, 319 flow. Second operand 6 states and 197 transitions. [2025-03-04 02:13:56,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 97 transitions, 625 flow [2025-03-04 02:13:56,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 97 transitions, 610 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 02:13:56,645 INFO L231 Difference]: Finished difference. Result has 77 places, 0 transitions, 0 flow [2025-03-04 02:13:56,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=80, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=77, PETRI_TRANSITIONS=0} [2025-03-04 02:13:56,647 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2025-03-04 02:13:56,647 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 0 transitions, 0 flow [2025-03-04 02:13:56,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 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:13:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-03-04 02:13:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-04 02:13:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-04 02:13:56,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-04 02:13:56,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-03-04 02:13:56,650 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-04 02:13:56,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 02:13:56,650 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:56,652 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:13:56,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:13:56,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:13:56 BasicIcfg [2025-03-04 02:13:56,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:13:56,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:13:56,658 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:13:56,658 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:13:56,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:13:52" (3/4) ... [2025-03-04 02:13:56,659 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:13:56,662 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-03-04 02:13:56,662 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 02:13:56,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2025-03-04 02:13:56,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 02:13:56,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-04 02:13:56,665 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 02:13:56,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:13:56,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:13:56,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:13:56,717 INFO L158 Benchmark]: Toolchain (without parser) took 5320.96ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 130.7MB in the beginning and 318.9MB in the end (delta: -188.2MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2025-03-04 02:13:56,717 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:13:56,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.22ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 110.1MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 02:13:56,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.17ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:13:56,718 INFO L158 Benchmark]: Boogie Preprocessor took 23.53ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:13:56,718 INFO L158 Benchmark]: IcfgBuilder took 449.09ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 68.6MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 02:13:56,718 INFO L158 Benchmark]: TraceAbstraction took 4477.77ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 68.1MB in the beginning and 323.2MB in the end (delta: -255.1MB). Peak memory consumption was 299.4MB. Max. memory is 16.1GB. [2025-03-04 02:13:56,718 INFO L158 Benchmark]: Witness Printer took 59.06ms. Allocated memory is still 478.2MB. Free memory was 323.2MB in the beginning and 318.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:13:56,720 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.66ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.22ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 110.1MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.17ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 108.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.53ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 106.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 449.09ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 68.6MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4477.77ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 68.1MB in the beginning and 323.2MB in the end (delta: -255.1MB). Peak memory consumption was 299.4MB. Max. memory is 16.1GB. * Witness Printer took 59.06ms. Allocated memory is still 478.2MB. Free memory was 323.2MB in the beginning and 318.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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 - 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 5 procedures, 107 locations, 6 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: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 459 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 422 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 122 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1111 IncrementalHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 122 mSolverCounterUnsat, 35 mSDtfsCounter, 1111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=607occurred in iteration=5, InterpolantAutomatonStates: 38, 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, 1.1s InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1042 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 02:13:56,733 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