./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-time-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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/weaver/chl-time-trans.wvr.c -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 ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:43:41,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:43:42,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:43:42,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:43:42,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:43:42,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:43:42,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:43:42,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:43:42,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:43:42,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:43:42,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:43:42,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:43:42,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:43:42,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:43:42,061 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:43:42,061 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:43:42,061 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:43:42,062 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:43:42,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:43:42,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:43:42,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:43:42,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:43:42,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:43:42,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:43:42,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:43:42,064 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 -> ef62179d17d90afe74c7b4fe8189ca3bb011e55daf3a169b42e4b3589691fc53 [2025-03-13 21:43:42,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:43:42,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:43:42,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:43:42,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:43:42,296 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:43:42,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-03-13 21:43:43,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45110c9b0/ffbf3ec074504972aed80d93bb92e8de/FLAG1e0c25280 [2025-03-13 21:43:43,665 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:43:43,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-time-trans.wvr.c [2025-03-13 21:43:43,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45110c9b0/ffbf3ec074504972aed80d93bb92e8de/FLAG1e0c25280 [2025-03-13 21:43:44,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45110c9b0/ffbf3ec074504972aed80d93bb92e8de [2025-03-13 21:43:44,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:43:44,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:43:44,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:43:44,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:43:44,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:43:44,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7443ce6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44, skipping insertion in model container [2025-03-13 21:43:44,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:43:44,146 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/weaver/chl-time-trans.wvr.c[2875,2888] [2025-03-13 21:43:44,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:43:44,156 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:43:44,172 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/weaver/chl-time-trans.wvr.c[2875,2888] [2025-03-13 21:43:44,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:43:44,188 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:43:44,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44 WrapperNode [2025-03-13 21:43:44,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:43:44,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:43:44,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:43:44,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:43:44,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,219 INFO L138 Inliner]: procedures = 22, calls = 24, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 207 [2025-03-13 21:43:44,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:43:44,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:43:44,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:43:44,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:43:44,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,236 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-13 21:43:44,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,236 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:43:44,246 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:43:44,246 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:43:44,246 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:43:44,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (1/1) ... [2025-03-13 21:43:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:43:44,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:44,270 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-13 21:43:44,272 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-13 21:43:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:43:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:43:44,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:43:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:43:44,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:43:44,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:43:44,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:43:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:43:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 21:43:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 21:43:44,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:43:44,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:43:44,288 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:43:44,355 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:43:44,357 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:43:44,625 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:43:44,626 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:43:44,626 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:43:44,960 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:43:44,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:43:44 BoogieIcfgContainer [2025-03-13 21:43:44,960 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:43:44,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:43:44,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:43:44,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:43:44,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:43:44" (1/3) ... [2025-03-13 21:43:44,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc69de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:43:44, skipping insertion in model container [2025-03-13 21:43:44,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:43:44" (2/3) ... [2025-03-13 21:43:44,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc69de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:43:44, skipping insertion in model container [2025-03-13 21:43:44,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:43:44" (3/3) ... [2025-03-13 21:43:44,968 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-trans.wvr.c [2025-03-13 21:43:44,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:43:44,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-trans.wvr.c that has 4 procedures, 26 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-13 21:43:44,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:43:45,030 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:43:45,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 71 flow [2025-03-13 21:43:45,082 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-13 21:43:45,084 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:43:45,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-13 21:43:45,087 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 25 transitions, 71 flow [2025-03-13 21:43:45,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 21 transitions, 60 flow [2025-03-13 21:43:45,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:43:45,101 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;@3db784d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:43:45,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:43:45,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:43:45,117 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-13 21:43:45,117 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:43:45,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:45,118 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] [2025-03-13 21:43:45,120 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:45,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:45,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1999843311, now seen corresponding path program 1 times [2025-03-13 21:43:45,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:45,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639454015] [2025-03-13 21:43:45,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:45,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:45,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:43:45,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:43:45,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:45,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:45,924 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-13 21:43:45,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:45,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639454015] [2025-03-13 21:43:45,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639454015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:45,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:45,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:45,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473989834] [2025-03-13 21:43:45,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:45,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:45,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:45,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:45,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-13 21:43:45,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:45,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:45,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-13 21:43:45,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:46,272 INFO L124 PetriNetUnfolderBase]: 178/337 cut-off events. [2025-03-13 21:43:46,273 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-13 21:43:46,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 337 events. 178/337 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1311 event pairs, 46 based on Foata normal form. 1/334 useless extension candidates. Maximal degree in co-relation 575. Up to 110 conditions per place. [2025-03-13 21:43:46,280 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 30 selfloop transitions, 2 changer transitions 8/44 dead transitions. [2025-03-13 21:43:46,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 210 flow [2025-03-13 21:43:46,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-03-13 21:43:46,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608 [2025-03-13 21:43:46,294 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 60 flow. Second operand 5 states and 76 transitions. [2025-03-13 21:43:46,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 210 flow [2025-03-13 21:43:46,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:43:46,299 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 63 flow [2025-03-13 21:43:46,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=63, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2025-03-13 21:43:46,304 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-03-13 21:43:46,304 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 63 flow [2025-03-13 21:43:46,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:46,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:46,306 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] [2025-03-13 21:43:46,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:43:46,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:46,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:46,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1821614207, now seen corresponding path program 2 times [2025-03-13 21:43:46,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:46,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064612123] [2025-03-13 21:43:46,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:46,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:46,324 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:43:46,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:43:46,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:46,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:46,718 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-13 21:43:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064612123] [2025-03-13 21:43:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064612123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477601161] [2025-03-13 21:43:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:46,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:46,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-13 21:43:46,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:46,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:46,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-13 21:43:46,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:46,955 INFO L124 PetriNetUnfolderBase]: 194/367 cut-off events. [2025-03-13 21:43:46,955 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2025-03-13 21:43:46,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 367 events. 194/367 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1558 event pairs, 24 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 839. Up to 151 conditions per place. [2025-03-13 21:43:46,958 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 32 selfloop transitions, 2 changer transitions 12/50 dead transitions. [2025-03-13 21:43:46,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 234 flow [2025-03-13 21:43:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-13 21:43:46,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-03-13 21:43:46,959 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 63 flow. Second operand 5 states and 80 transitions. [2025-03-13 21:43:46,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 234 flow [2025-03-13 21:43:46,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 227 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:46,961 INFO L231 Difference]: Finished difference. Result has 36 places, 22 transitions, 73 flow [2025-03-13 21:43:46,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=36, PETRI_TRANSITIONS=22} [2025-03-13 21:43:46,961 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-03-13 21:43:46,961 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 22 transitions, 73 flow [2025-03-13 21:43:46,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:46,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:46,962 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] [2025-03-13 21:43:46,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:43:46,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1506808459, now seen corresponding path program 3 times [2025-03-13 21:43:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167691694] [2025-03-13 21:43:46,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:46,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:43:46,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:43:46,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:43:46,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:47,278 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-13 21:43:47,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:47,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167691694] [2025-03-13 21:43:47,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167691694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:47,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044386895] [2025-03-13 21:43:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:47,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:47,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:47,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:47,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:47,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-13 21:43:47,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 22 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:47,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:47,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-13 21:43:47,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:47,451 INFO L124 PetriNetUnfolderBase]: 153/301 cut-off events. [2025-03-13 21:43:47,451 INFO L125 PetriNetUnfolderBase]: For 315/315 co-relation queries the response was YES. [2025-03-13 21:43:47,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 301 events. 153/301 cut-off events. For 315/315 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1150 event pairs, 35 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 745. Up to 109 conditions per place. [2025-03-13 21:43:47,454 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 31 selfloop transitions, 3 changer transitions 8/46 dead transitions. [2025-03-13 21:43:47,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 229 flow [2025-03-13 21:43:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:47,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-03-13 21:43:47,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.616 [2025-03-13 21:43:47,456 INFO L175 Difference]: Start difference. First operand has 36 places, 22 transitions, 73 flow. Second operand 5 states and 77 transitions. [2025-03-13 21:43:47,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 229 flow [2025-03-13 21:43:47,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 210 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-13 21:43:47,459 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 84 flow [2025-03-13 21:43:47,459 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2025-03-13 21:43:47,459 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2025-03-13 21:43:47,459 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 84 flow [2025-03-13 21:43:47,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:47,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:47,460 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] [2025-03-13 21:43:47,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:43:47,460 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:47,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:47,460 INFO L85 PathProgramCache]: Analyzing trace with hash -775178481, now seen corresponding path program 4 times [2025-03-13 21:43:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118583899] [2025-03-13 21:43:47,461 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:47,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:47,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-13 21:43:47,477 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:43:47,477 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:43:47,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:47,676 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-13 21:43:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:47,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118583899] [2025-03-13 21:43:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118583899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:47,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:47,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670705808] [2025-03-13 21:43:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:47,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:47,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:47,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:47,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-13 21:43:47,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:47,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:47,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-13 21:43:47,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:47,848 INFO L124 PetriNetUnfolderBase]: 160/316 cut-off events. [2025-03-13 21:43:47,849 INFO L125 PetriNetUnfolderBase]: For 356/356 co-relation queries the response was YES. [2025-03-13 21:43:47,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 316 events. 160/316 cut-off events. For 356/356 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1268 event pairs, 28 based on Foata normal form. 1/315 useless extension candidates. Maximal degree in co-relation 840. Up to 137 conditions per place. [2025-03-13 21:43:47,850 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 30 selfloop transitions, 2 changer transitions 12/48 dead transitions. [2025-03-13 21:43:47,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 251 flow [2025-03-13 21:43:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:47,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-13 21:43:47,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.624 [2025-03-13 21:43:47,853 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 84 flow. Second operand 5 states and 78 transitions. [2025-03-13 21:43:47,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 251 flow [2025-03-13 21:43:47,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 244 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:43:47,854 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 93 flow [2025-03-13 21:43:47,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2025-03-13 21:43:47,855 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2025-03-13 21:43:47,855 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 23 transitions, 93 flow [2025-03-13 21:43:47,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:47,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:47,856 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] [2025-03-13 21:43:47,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:43:47,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:47,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:47,856 INFO L85 PathProgramCache]: Analyzing trace with hash 168437575, now seen corresponding path program 5 times [2025-03-13 21:43:47,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:47,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171940081] [2025-03-13 21:43:47,856 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:43:47,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:47,864 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:43:47,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:43:47,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:43:47,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:48,045 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-13 21:43:48,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171940081] [2025-03-13 21:43:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171940081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867162213] [2025-03-13 21:43:48,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:48,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:48,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:48,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:48,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:48,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-13 21:43:48,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 23 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:48,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:48,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-13 21:43:48,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:48,190 INFO L124 PetriNetUnfolderBase]: 111/226 cut-off events. [2025-03-13 21:43:48,190 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-13 21:43:48,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 226 events. 111/226 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 802 event pairs, 21 based on Foata normal form. 1/226 useless extension candidates. Maximal degree in co-relation 642. Up to 69 conditions per place. [2025-03-13 21:43:48,191 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 20 selfloop transitions, 1 changer transitions 19/44 dead transitions. [2025-03-13 21:43:48,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 230 flow [2025-03-13 21:43:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-03-13 21:43:48,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-13 21:43:48,193 INFO L175 Difference]: Start difference. First operand has 42 places, 23 transitions, 93 flow. Second operand 5 states and 75 transitions. [2025-03-13 21:43:48,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 230 flow [2025-03-13 21:43:48,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 218 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:43:48,194 INFO L231 Difference]: Finished difference. Result has 43 places, 21 transitions, 73 flow [2025-03-13 21:43:48,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=43, PETRI_TRANSITIONS=21} [2025-03-13 21:43:48,199 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-03-13 21:43:48,199 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 21 transitions, 73 flow [2025-03-13 21:43:48,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:48,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:48,199 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] [2025-03-13 21:43:48,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:43:48,200 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:43:48,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2069489509, now seen corresponding path program 6 times [2025-03-13 21:43:48,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:48,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202888532] [2025-03-13 21:43:48,200 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:43:48,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:48,209 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:43:48,215 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:43:48,215 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:43:48,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:48,419 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-13 21:43:48,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:48,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202888532] [2025-03-13 21:43:48,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202888532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:48,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:48,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:43:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034502380] [2025-03-13 21:43:48,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:48,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:43:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:48,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:43:48,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:43:48,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 25 [2025-03-13 21:43:48,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 21 transitions, 73 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:48,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:48,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 25 [2025-03-13 21:43:48,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:48,544 INFO L124 PetriNetUnfolderBase]: 52/115 cut-off events. [2025-03-13 21:43:48,544 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2025-03-13 21:43:48,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 115 events. 52/115 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 296 event pairs, 10 based on Foata normal form. 1/115 useless extension candidates. Maximal degree in co-relation 327. Up to 54 conditions per place. [2025-03-13 21:43:48,545 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-03-13 21:43:48,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 147 flow [2025-03-13 21:43:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:43:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:43:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-03-13 21:43:48,546 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.496 [2025-03-13 21:43:48,547 INFO L175 Difference]: Start difference. First operand has 43 places, 21 transitions, 73 flow. Second operand 5 states and 62 transitions. [2025-03-13 21:43:48,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 147 flow [2025-03-13 21:43:48,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 133 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-13 21:43:48,548 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2025-03-13 21:43:48,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2025-03-13 21:43:48,550 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2025-03-13 21:43:48,550 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 0 transitions, 0 flow [2025-03-13 21:43:48,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 21:43:48,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-13 21:43:48,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-13 21:43:48,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-13 21:43:48,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-13 21:43:48,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:43:48,553 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-03-13 21:43:48,556 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 21:43:48,557 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 21:43:48,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 09:43:48 BasicIcfg [2025-03-13 21:43:48,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 21:43:48,562 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 21:43:48,562 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 21:43:48,562 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 21:43:48,563 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:43:44" (3/4) ... [2025-03-13 21:43:48,564 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 21:43:48,567 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 21:43:48,567 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 21:43:48,567 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 21:43:48,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 80 nodes and edges [2025-03-13 21:43:48,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-13 21:43:48,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 21:43:48,572 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-13 21:43:48,625 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 21:43:48,625 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 21:43:48,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 21:43:48,626 INFO L158 Benchmark]: Toolchain (without parser) took 4609.57ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.1MB in the beginning and 108.5MB in the end (delta: 1.6MB). Peak memory consumption was 140.6MB. Max. memory is 16.1GB. [2025-03-13 21:43:48,627 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:43:48,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.77ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 98.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:43:48,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.41ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 21:43:48,629 INFO L158 Benchmark]: Boogie Preprocessor took 25.53ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:43:48,629 INFO L158 Benchmark]: IcfgBuilder took 714.41ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 71.8MB in the end (delta: 22.4MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-13 21:43:48,630 INFO L158 Benchmark]: TraceAbstraction took 3600.02ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 71.8MB in the beginning and 113.9MB in the end (delta: -42.0MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. [2025-03-13 21:43:48,630 INFO L158 Benchmark]: Witness Printer took 63.52ms. Allocated memory is still 285.2MB. Free memory was 113.9MB in the beginning and 108.5MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 21:43:48,631 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.16ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.77ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 98.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.41ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.53ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 714.41ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 71.8MB in the end (delta: 22.4MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3600.02ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 71.8MB in the beginning and 113.9MB in the end (delta: -42.0MB). Peak memory consumption was 101.2MB. Max. memory is 16.1GB. * Witness Printer took 63.52ms. Allocated memory is still 285.2MB. Free memory was 113.9MB in the beginning and 108.5MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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 7 procedures, 41 locations, 4 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: 3.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 604 IncrementalHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 0 mSDtfsCounter, 604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=4, InterpolantAutomatonStates: 30, 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.9s InterpolantComputationTime, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 2448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 21:43:48,645 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