./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c --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/weaver/chl-file-item-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 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:18:39,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:18:39,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:18:39,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:18:39,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:18:39,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:18:39,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:18:39,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:18:39,506 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:18:39,506 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:18:39,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:18:39,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:18:39,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:18:39,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:18:39,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:18:39,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:39,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:18:39,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:18:39,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:18:39,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:18:39,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:18:39,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:18:39,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:18:39,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:18:39,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:18:39,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:18:39,511 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 -> 408d8d7e58240f749ab11087191b04ec647cfea8447827b0505b793eb68a9c0a [2025-03-04 02:18:39,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:18:39,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:18:39,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:18:39,756 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:18:39,756 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:18:39,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-03-04 02:18:40,851 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4787b30/bbf5f461d7764ea298546a10aa6e3a63/FLAGf06576576 [2025-03-04 02:18:41,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:18:41,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-trans.wvr.c [2025-03-04 02:18:41,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4787b30/bbf5f461d7764ea298546a10aa6e3a63/FLAGf06576576 [2025-03-04 02:18:41,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de4787b30/bbf5f461d7764ea298546a10aa6e3a63 [2025-03-04 02:18:41,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:18:41,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:18:41,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:41,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:18:41,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:18:41,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2959b12a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41, skipping insertion in model container [2025-03-04 02:18:41,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,431 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:18:41,555 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-file-item-trans.wvr.c[2856,2869] [2025-03-04 02:18:41,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:41,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:18:41,592 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-file-item-trans.wvr.c[2856,2869] [2025-03-04 02:18:41,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:18:41,609 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:18:41,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41 WrapperNode [2025-03-04 02:18:41,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:18:41,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:41,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:18:41,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:18:41,616 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:18:41" (1/1) ... [2025-03-04 02:18:41,621 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:18:41" (1/1) ... [2025-03-04 02:18:41,645 INFO L138 Inliner]: procedures = 22, calls = 15, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 192 [2025-03-04 02:18:41,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:18:41,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:18:41,647 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:18:41,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:18:41,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,667 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-04 02:18:41,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,667 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:18:41,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:18:41,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:18:41,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:18:41,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (1/1) ... [2025-03-04 02:18:41,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:18:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:18:41,699 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:18:41,701 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:18:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:18:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 02:18:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 02:18:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 02:18:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 02:18:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 02:18:41,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 02:18:41,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:18:41,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:18:41,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:18:41,720 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:18:41,789 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:18:41,790 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:18:42,015 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:18:42,015 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:18:42,305 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:18:42,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:18:42,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:42 BoogieIcfgContainer [2025-03-04 02:18:42,306 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:18:42,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:18:42,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:18:42,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:18:42,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:18:41" (1/3) ... [2025-03-04 02:18:42,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e61e18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:42, skipping insertion in model container [2025-03-04 02:18:42,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:18:41" (2/3) ... [2025-03-04 02:18:42,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e61e18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:18:42, skipping insertion in model container [2025-03-04 02:18:42,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:42" (3/3) ... [2025-03-04 02:18:42,314 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-trans.wvr.c [2025-03-04 02:18:42,325 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:18:42,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-trans.wvr.c that has 4 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-04 02:18:42,327 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:18:42,378 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 02:18:42,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 59 flow [2025-03-04 02:18:42,425 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-04 02:18:42,427 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:42,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 16 events. 0/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 02:18:42,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 19 transitions, 59 flow [2025-03-04 02:18:42,432 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 15 transitions, 48 flow [2025-03-04 02:18:42,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:18:42,449 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;@71f2085a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:18:42,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 02:18:42,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:18:42,460 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-04 02:18:42,460 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 02:18:42,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:42,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:42,462 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-04 02:18:42,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:42,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1317201625, now seen corresponding path program 1 times [2025-03-04 02:18:42,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:42,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626696455] [2025-03-04 02:18:42,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:18:42,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:42,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:18:42,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:18:42,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:18:42,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:43,838 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:18:43,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:43,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626696455] [2025-03-04 02:18:43,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626696455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:43,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:43,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:43,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989483033] [2025-03-04 02:18:43,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:43,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:43,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:43,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:43,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:43,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-04 02:18:43,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 15 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:43,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:43,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-04 02:18:43,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:44,161 INFO L124 PetriNetUnfolderBase]: 32/85 cut-off events. [2025-03-04 02:18:44,162 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 02:18:44,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 85 events. 32/85 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 223 event pairs, 1 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 145. Up to 34 conditions per place. [2025-03-04 02:18:44,166 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 6 changer transitions 5/38 dead transitions. [2025-03-04 02:18:44,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 198 flow [2025-03-04 02:18:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:44,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-03-04 02:18:44,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-03-04 02:18:44,180 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 48 flow. Second operand 6 states and 62 transitions. [2025-03-04 02:18:44,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 198 flow [2025-03-04 02:18:44,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:44,185 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 69 flow [2025-03-04 02:18:44,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=69, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2025-03-04 02:18:44,189 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2025-03-04 02:18:44,189 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 69 flow [2025-03-04 02:18:44,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:44,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:44,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:44,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:18:44,190 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-04 02:18:44,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2102086461, now seen corresponding path program 2 times [2025-03-04 02:18:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182629877] [2025-03-04 02:18:44,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:18:44,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:44,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:18:44,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:18:44,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:44,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:44,959 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:18:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182629877] [2025-03-04 02:18:44,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182629877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:44,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:44,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:44,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705659608] [2025-03-04 02:18:44,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:44,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:44,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:44,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:44,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-04 02:18:44,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:44,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:44,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-04 02:18:44,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:45,246 INFO L124 PetriNetUnfolderBase]: 31/97 cut-off events. [2025-03-04 02:18:45,247 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-04 02:18:45,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 97 events. 31/97 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 321 event pairs, 4 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 256. Up to 46 conditions per place. [2025-03-04 02:18:45,248 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 7 changer transitions 8/42 dead transitions. [2025-03-04 02:18:45,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 42 transitions, 220 flow [2025-03-04 02:18:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2025-03-04 02:18:45,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2025-03-04 02:18:45,249 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 69 flow. Second operand 6 states and 63 transitions. [2025-03-04 02:18:45,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 42 transitions, 220 flow [2025-03-04 02:18:45,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 42 transitions, 216 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 02:18:45,251 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 92 flow [2025-03-04 02:18:45,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2025-03-04 02:18:45,251 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-03-04 02:18:45,251 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 20 transitions, 92 flow [2025-03-04 02:18:45,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:45,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:45,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:45,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:18:45,252 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-04 02:18:45,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:45,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1313450515, now seen corresponding path program 3 times [2025-03-04 02:18:45,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:45,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51358544] [2025-03-04 02:18:45,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:18:45,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:45,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:18:45,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:18:45,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:18:45,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:45,804 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:18:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51358544] [2025-03-04 02:18:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51358544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:45,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:45,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539157301] [2025-03-04 02:18:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:45,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:45,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:45,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:45,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:45,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-04 02:18:45,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 20 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:45,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:45,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-04 02:18:45,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:46,014 INFO L124 PetriNetUnfolderBase]: 27/83 cut-off events. [2025-03-04 02:18:46,014 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2025-03-04 02:18:46,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 83 events. 27/83 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 244 event pairs, 1 based on Foata normal form. 1/84 useless extension candidates. Maximal degree in co-relation 262. Up to 38 conditions per place. [2025-03-04 02:18:46,015 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 23 selfloop transitions, 6 changer transitions 9/39 dead transitions. [2025-03-04 02:18:46,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 39 transitions, 228 flow [2025-03-04 02:18:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-03-04 02:18:46,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-03-04 02:18:46,019 INFO L175 Difference]: Start difference. First operand has 32 places, 20 transitions, 92 flow. Second operand 6 states and 62 transitions. [2025-03-04 02:18:46,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 39 transitions, 228 flow [2025-03-04 02:18:46,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 213 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-03-04 02:18:46,021 INFO L231 Difference]: Finished difference. Result has 36 places, 19 transitions, 96 flow [2025-03-04 02:18:46,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=19} [2025-03-04 02:18:46,022 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2025-03-04 02:18:46,022 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 96 flow [2025-03-04 02:18:46,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:46,022 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:46,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:18:46,024 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-04 02:18:46,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1337574181, now seen corresponding path program 4 times [2025-03-04 02:18:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-03-04 02:18:46,025 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:18:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,035 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-04 02:18:46,044 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:18:46,044 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:18:46,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:46,481 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:18:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:46,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438685752] [2025-03-04 02:18:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438685752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:46,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:46,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495780625] [2025-03-04 02:18:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:46,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:46,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:46,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:46,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-04 02:18:46,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 19 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:46,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:46,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-04 02:18:46,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:46,630 INFO L124 PetriNetUnfolderBase]: 14/47 cut-off events. [2025-03-04 02:18:46,630 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 02:18:46,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 47 events. 14/47 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 2 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 164. Up to 18 conditions per place. [2025-03-04 02:18:46,632 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 16 selfloop transitions, 4 changer transitions 7/28 dead transitions. [2025-03-04 02:18:46,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 173 flow [2025-03-04 02:18:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 02:18:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 02:18:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-03-04 02:18:46,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4842105263157895 [2025-03-04 02:18:46,633 INFO L175 Difference]: Start difference. First operand has 36 places, 19 transitions, 96 flow. Second operand 5 states and 46 transitions. [2025-03-04 02:18:46,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 173 flow [2025-03-04 02:18:46,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 152 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:46,635 INFO L231 Difference]: Finished difference. Result has 33 places, 17 transitions, 74 flow [2025-03-04 02:18:46,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=33, PETRI_TRANSITIONS=17} [2025-03-04 02:18:46,635 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-03-04 02:18:46,635 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 17 transitions, 74 flow [2025-03-04 02:18:46,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:46,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:46,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:46,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:18:46,636 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-04 02:18:46,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 123674369, now seen corresponding path program 5 times [2025-03-04 02:18:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:46,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 02:18:46,636 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:18:46,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:46,647 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:18:46,655 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:18:46,655 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:18:46,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:47,118 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:18:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:47,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186422006] [2025-03-04 02:18:47,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186422006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:47,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:47,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:47,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053704491] [2025-03-04 02:18:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:47,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:47,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:47,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:47,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-04 02:18:47,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 17 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:47,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:47,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-04 02:18:47,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:47,306 INFO L124 PetriNetUnfolderBase]: 8/37 cut-off events. [2025-03-04 02:18:47,307 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 02:18:47,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 37 events. 8/37 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 75. Up to 17 conditions per place. [2025-03-04 02:18:47,307 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 13 selfloop transitions, 3 changer transitions 10/27 dead transitions. [2025-03-04 02:18:47,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 157 flow [2025-03-04 02:18:47,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:47,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-03-04 02:18:47,308 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2025-03-04 02:18:47,308 INFO L175 Difference]: Start difference. First operand has 33 places, 17 transitions, 74 flow. Second operand 6 states and 51 transitions. [2025-03-04 02:18:47,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 157 flow [2025-03-04 02:18:47,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 132 flow, removed 2 selfloop flow, removed 7 redundant places. [2025-03-04 02:18:47,310 INFO L231 Difference]: Finished difference. Result has 32 places, 15 transitions, 55 flow [2025-03-04 02:18:47,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=55, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2025-03-04 02:18:47,310 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-03-04 02:18:47,310 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 15 transitions, 55 flow [2025-03-04 02:18:47,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:47,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:18:47,310 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:18:47,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:18:47,311 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-04 02:18:47,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:18:47,311 INFO L85 PathProgramCache]: Analyzing trace with hash 978981023, now seen corresponding path program 6 times [2025-03-04 02:18:47,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:18:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-04 02:18:47,311 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:18:47,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:18:47,320 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:18:47,325 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:18:47,326 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 02:18:47,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:18:47,700 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:18:47,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:18:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564993150] [2025-03-04 02:18:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564993150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:18:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:18:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 02:18:47,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972131234] [2025-03-04 02:18:47,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:18:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 02:18:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:18:47,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 02:18:47,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 02:18:47,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-04 02:18:47,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 15 transitions, 55 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:47,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:18:47,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-04 02:18:47,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:18:47,815 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-03-04 02:18:47,815 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 02:18:47,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 19 events. 3/19 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 60. Up to 7 conditions per place. [2025-03-04 02:18:47,816 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-03-04 02:18:47,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 16 transitions, 87 flow [2025-03-04 02:18:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 02:18:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 02:18:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2025-03-04 02:18:47,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2025-03-04 02:18:47,817 INFO L175 Difference]: Start difference. First operand has 32 places, 15 transitions, 55 flow. Second operand 6 states and 41 transitions. [2025-03-04 02:18:47,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 16 transitions, 87 flow [2025-03-04 02:18:47,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 16 transitions, 74 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 02:18:47,818 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2025-03-04 02:18:47,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=27, PETRI_TRANSITIONS=0} [2025-03-04 02:18:47,819 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2025-03-04 02:18:47,819 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 0 transitions, 0 flow [2025-03-04 02:18:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:18:47,822 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-04 02:18:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-04 02:18:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 02:18:47,823 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 02:18:47,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 02:18:47,823 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-03-04 02:18:47,826 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 02:18:47,827 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 02:18:47,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:18:47 BasicIcfg [2025-03-04 02:18:47,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 02:18:47,832 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 02:18:47,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 02:18:47,833 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 02:18:47,833 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:18:42" (3/4) ... [2025-03-04 02:18:47,834 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 02:18:47,837 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 02:18:47,837 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 02:18:47,837 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 02:18:47,839 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2025-03-04 02:18:47,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-04 02:18:47,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 02:18:47,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 02:18:47,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 02:18:47,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 02:18:47,892 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 02:18:47,892 INFO L158 Benchmark]: Toolchain (without parser) took 6477.87ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 123.9MB in the beginning and 167.8MB in the end (delta: -43.9MB). Peak memory consumption was 190.1MB. Max. memory is 16.1GB. [2025-03-04 02:18:47,892 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:18:47,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.33ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:18:47,893 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.71ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 109.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:18:47,893 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 02:18:47,893 INFO L158 Benchmark]: IcfgBuilder took 630.90ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.1MB in the end (delta: 2.0MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2025-03-04 02:18:47,893 INFO L158 Benchmark]: TraceAbstraction took 5523.52ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 105.3MB in the beginning and 176.1MB in the end (delta: -70.8MB). Peak memory consumption was 167.4MB. Max. memory is 16.1GB. [2025-03-04 02:18:47,893 INFO L158 Benchmark]: Witness Printer took 59.20ms. Allocated memory is still 402.7MB. Free memory was 176.1MB in the beginning and 167.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 02:18:47,894 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.21ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.33ms. Allocated memory is still 167.8MB. Free memory was 123.9MB in the beginning and 112.0MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.71ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 109.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 167.8MB. Free memory was 109.6MB in the beginning and 108.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 630.90ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.1MB in the end (delta: 2.0MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5523.52ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 105.3MB in the beginning and 176.1MB in the end (delta: -70.8MB). Peak memory consumption was 167.4MB. Max. memory is 16.1GB. * Witness Printer took 59.20ms. Allocated memory is still 402.7MB. Free memory was 176.1MB in the beginning and 167.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: 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, 29 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: 5.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 341 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 0 mSDtfsCounter, 341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=3, InterpolantAutomatonStates: 35, 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.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 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-04 02:18:47,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE