./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-sre-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-sre-subst.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 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:30:30,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:30:30,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:30:30,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:30:30,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:30:30,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:30:30,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:30:30,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:30:30,192 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:30:30,192 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:30:30,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:30:30,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:30:30,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:30:30,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:30:30,193 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:30:30,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:30:30,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:30:30,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:30:30,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:30:30,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:30:30,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:30:30,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:30:30,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:30:30,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:30:30,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:30:30,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:30:30,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:30:30,197 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 -> 3f15efb4f8a286b7a1ad39e3d0e5f0f11fbc70672e37c5d5b49fafb43ac86a5c [2025-03-08 17:30:30,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:30:30,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:30:30,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:30:30,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:30:30,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:30:30,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2025-03-08 17:30:31,551 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1024d240f/12ef4c8565b7410ba8413cfac61041d5/FLAG598db289f [2025-03-08 17:30:31,745 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:30:31,745 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-sre-subst.wvr.c [2025-03-08 17:30:31,760 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1024d240f/12ef4c8565b7410ba8413cfac61041d5/FLAG598db289f [2025-03-08 17:30:32,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1024d240f/12ef4c8565b7410ba8413cfac61041d5 [2025-03-08 17:30:32,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:30:32,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:30:32,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:30:32,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:30:32,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:30:32,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143cf91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32, skipping insertion in model container [2025-03-08 17:30:32,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:30:32,254 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-sre-subst.wvr.c[2372,2385] [2025-03-08 17:30:32,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:30:32,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:30:32,286 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-sre-subst.wvr.c[2372,2385] [2025-03-08 17:30:32,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:30:32,299 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:30:32,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32 WrapperNode [2025-03-08 17:30:32,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:30:32,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:30:32,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:30:32,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:30:32,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,328 INFO L138 Inliner]: procedures = 21, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2025-03-08 17:30:32,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:30:32,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:30:32,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:30:32,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:30:32,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,351 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-08 17:30:32,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:30:32,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:30:32,359 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:30:32,359 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:30:32,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (1/1) ... [2025-03-08 17:30:32,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:30:32,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:30:32,383 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-08 17:30:32,387 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-08 17:30:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:30:32,406 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:30:32,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:30:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:30:32,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:30:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:30:32,407 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:30:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:30:32,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:30:32,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:30:32,409 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:30:32,483 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:30:32,484 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:30:32,606 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:30:32,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:30:32,719 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:30:32,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:30:32,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:32 BoogieIcfgContainer [2025-03-08 17:30:32,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:30:32,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:30:32,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:30:32,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:30:32,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:30:32" (1/3) ... [2025-03-08 17:30:32,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfbfc42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:32, skipping insertion in model container [2025-03-08 17:30:32,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:30:32" (2/3) ... [2025-03-08 17:30:32,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dfbfc42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:30:32, skipping insertion in model container [2025-03-08 17:30:32,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:32" (3/3) ... [2025-03-08 17:30:32,727 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-sre-subst.wvr.c [2025-03-08 17:30:32,737 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:30:32,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-sre-subst.wvr.c that has 4 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 17:30:32,738 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:30:32,774 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:30:32,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 59 flow [2025-03-08 17:30:32,832 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-08 17:30:32,835 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:30:32,837 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 6 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-08 17:30:32,840 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 19 transitions, 59 flow [2025-03-08 17:30:32,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 15 transitions, 48 flow [2025-03-08 17:30:32,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:30:32,863 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;@43df71bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:30:32,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:30:32,875 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:30:32,876 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-08 17:30:32,876 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:30:32,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:32,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:30:32,877 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-08 17:30:32,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1258264527, now seen corresponding path program 1 times [2025-03-08 17:30:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:32,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425067238] [2025-03-08 17:30:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:30:32,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:32,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:30:33,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:30:33,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:30:33,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:34,760 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-08 17:30:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425067238] [2025-03-08 17:30:34,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425067238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:34,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760537310] [2025-03-08 17:30:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:34,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:30:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:34,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:30:34,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:30:34,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:30:34,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 15 transitions, 48 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-08 17:30:34,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:34,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:30:34,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:35,194 INFO L124 PetriNetUnfolderBase]: 32/85 cut-off events. [2025-03-08 17:30:35,195 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-08 17:30:35,195 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 227 event pairs, 1 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 145. Up to 33 conditions per place. [2025-03-08 17:30:35,198 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 6 changer transitions 5/38 dead transitions. [2025-03-08 17:30:35,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 198 flow [2025-03-08 17:30:35,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:30:35,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:30:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2025-03-08 17:30:35,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2025-03-08 17:30:35,209 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 48 flow. Second operand 7 states and 66 transitions. [2025-03-08 17:30:35,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 198 flow [2025-03-08 17:30:35,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:30:35,216 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 69 flow [2025-03-08 17:30:35,217 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=7, PETRI_FLOW=69, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2025-03-08 17:30:35,221 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2025-03-08 17:30:35,222 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 69 flow [2025-03-08 17:30:35,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 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-08 17:30:35,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:35,223 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:30:35,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:30:35,223 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-08 17:30:35,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:35,224 INFO L85 PathProgramCache]: Analyzing trace with hash -471291049, now seen corresponding path program 2 times [2025-03-08 17:30:35,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:35,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865307483] [2025-03-08 17:30:35,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:30:35,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:35,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:30:35,266 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:30:35,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:30:35,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:35,948 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-08 17:30:35,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:35,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865307483] [2025-03-08 17:30:35,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865307483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:35,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:35,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:35,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512425776] [2025-03-08 17:30:35,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:35,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:35,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:35,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:35,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:35,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:30:35,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 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-08 17:30:35,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:35,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:30:35,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:36,120 INFO L124 PetriNetUnfolderBase]: 31/97 cut-off events. [2025-03-08 17:30:36,120 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-08 17:30:36,123 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, 3 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 256. Up to 46 conditions per place. [2025-03-08 17:30:36,123 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 7 changer transitions 7/41 dead transitions. [2025-03-08 17:30:36,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 213 flow [2025-03-08 17:30:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:30:36,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:30:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2025-03-08 17:30:36,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5614035087719298 [2025-03-08 17:30:36,125 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 69 flow. Second operand 6 states and 64 transitions. [2025-03-08 17:30:36,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 213 flow [2025-03-08 17:30:36,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 208 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-08 17:30:36,127 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 97 flow [2025-03-08 17:30:36,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=66, 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2025-03-08 17:30:36,127 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-03-08 17:30:36,127 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 97 flow [2025-03-08 17:30:36,128 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-08 17:30:36,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:36,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:30:36,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:30:36,128 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-08 17:30:36,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:36,128 INFO L85 PathProgramCache]: Analyzing trace with hash 408139271, now seen corresponding path program 3 times [2025-03-08 17:30:36,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750483386] [2025-03-08 17:30:36,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:30:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:36,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:30:36,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:30:36,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:30:36,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:36,766 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-08 17:30:36,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:36,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750483386] [2025-03-08 17:30:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750483386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:36,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:36,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:36,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028477549] [2025-03-08 17:30:36,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:36,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:36,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:36,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:36,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:36,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:30:36,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 97 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-08 17:30:36,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:36,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:30:36,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:36,980 INFO L124 PetriNetUnfolderBase]: 28/87 cut-off events. [2025-03-08 17:30:36,980 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-08 17:30:36,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 87 events. 28/87 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 267 event pairs, 1 based on Foata normal form. 1/88 useless extension candidates. Maximal degree in co-relation 284. Up to 42 conditions per place. [2025-03-08 17:30:36,981 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 23 selfloop transitions, 6 changer transitions 9/39 dead transitions. [2025-03-08 17:30:36,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 39 transitions, 234 flow [2025-03-08 17:30:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:30:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:30:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-03-08 17:30:36,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-03-08 17:30:36,982 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 97 flow. Second operand 6 states and 62 transitions. [2025-03-08 17:30:36,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 39 transitions, 234 flow [2025-03-08 17:30:36,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 39 transitions, 220 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-08 17:30:36,984 INFO L231 Difference]: Finished difference. Result has 37 places, 19 transitions, 97 flow [2025-03-08 17:30:36,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=97, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2025-03-08 17:30:36,985 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-03-08 17:30:36,985 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 97 flow [2025-03-08 17:30:36,985 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-08 17:30:36,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:36,985 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:30:36,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:30:36,985 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-08 17:30:36,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 384015605, now seen corresponding path program 4 times [2025-03-08 17:30:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:36,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245954467] [2025-03-08 17:30:36,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:30:36,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:36,991 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-08 17:30:36,998 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:30:36,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:30:36,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:37,466 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-08 17:30:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245954467] [2025-03-08 17:30:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245954467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:37,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:37,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:37,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412623454] [2025-03-08 17:30:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:37,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:37,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:37,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:37,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:37,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:30:37,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 19 transitions, 97 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-08 17:30:37,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:37,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:30:37,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:37,745 INFO L124 PetriNetUnfolderBase]: 15/51 cut-off events. [2025-03-08 17:30:37,746 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-08 17:30:37,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 51 events. 15/51 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 0 based on Foata normal form. 1/52 useless extension candidates. Maximal degree in co-relation 179. Up to 16 conditions per place. [2025-03-08 17:30:37,749 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 16 selfloop transitions, 5 changer transitions 10/32 dead transitions. [2025-03-08 17:30:37,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 200 flow [2025-03-08 17:30:37,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:30:37,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:30:37,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-03-08 17:30:37,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2025-03-08 17:30:37,751 INFO L175 Difference]: Start difference. First operand has 37 places, 19 transitions, 97 flow. Second operand 6 states and 55 transitions. [2025-03-08 17:30:37,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 200 flow [2025-03-08 17:30:37,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 183 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-08 17:30:37,753 INFO L231 Difference]: Finished difference. Result has 36 places, 17 transitions, 78 flow [2025-03-08 17:30:37,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=36, PETRI_TRANSITIONS=17} [2025-03-08 17:30:37,753 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2025-03-08 17:30:37,753 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 17 transitions, 78 flow [2025-03-08 17:30:37,758 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-08 17:30:37,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:37,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:30:37,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:30:37,759 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-08 17:30:37,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:37,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1845264155, now seen corresponding path program 5 times [2025-03-08 17:30:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:37,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482239038] [2025-03-08 17:30:37,760 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:30:37,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:37,771 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:30:37,790 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:30:37,791 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:30:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:38,405 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-08 17:30:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:38,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482239038] [2025-03-08 17:30:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482239038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:38,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:38,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578643261] [2025-03-08 17:30:38,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:38,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:38,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:38,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:30:38,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 17 transitions, 78 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-08 17:30:38,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:38,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:30:38,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:38,585 INFO L124 PetriNetUnfolderBase]: 8/37 cut-off events. [2025-03-08 17:30:38,586 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-08 17:30:38,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 37 events. 8/37 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 126. Up to 17 conditions per place. [2025-03-08 17:30:38,586 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 13 selfloop transitions, 3 changer transitions 10/27 dead transitions. [2025-03-08 17:30:38,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 163 flow [2025-03-08 17:30:38,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:30:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:30:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-03-08 17:30:38,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2025-03-08 17:30:38,587 INFO L175 Difference]: Start difference. First operand has 36 places, 17 transitions, 78 flow. Second operand 6 states and 51 transitions. [2025-03-08 17:30:38,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 163 flow [2025-03-08 17:30:38,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 129 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-08 17:30:38,588 INFO L231 Difference]: Finished difference. Result has 32 places, 15 transitions, 53 flow [2025-03-08 17:30:38,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=50, 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=53, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2025-03-08 17:30:38,589 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-03-08 17:30:38,589 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 15 transitions, 53 flow [2025-03-08 17:30:38,589 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-08 17:30:38,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:38,589 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:30:38,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:30:38,589 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-08 17:30:38,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:38,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1594396487, now seen corresponding path program 6 times [2025-03-08 17:30:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:38,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994366428] [2025-03-08 17:30:38,590 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:30:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:38,594 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:30:38,603 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:30:38,604 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:30:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:39,093 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-08 17:30:39,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:39,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994366428] [2025-03-08 17:30:39,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994366428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:39,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:39,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:39,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111123965] [2025-03-08 17:30:39,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:39,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:39,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:39,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:39,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:39,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:30:39,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 15 transitions, 53 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-08 17:30:39,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:39,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:30:39,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:39,368 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-03-08 17:30:39,368 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:30:39,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 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 58. Up to 7 conditions per place. [2025-03-08 17:30:39,368 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-03-08 17:30:39,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 16 transitions, 85 flow [2025-03-08 17:30:39,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:30:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:30:39,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2025-03-08 17:30:39,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2025-03-08 17:30:39,369 INFO L175 Difference]: Start difference. First operand has 32 places, 15 transitions, 53 flow. Second operand 6 states and 41 transitions. [2025-03-08 17:30:39,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 16 transitions, 85 flow [2025-03-08 17:30:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 16 transitions, 74 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-08 17:30:39,370 INFO L231 Difference]: Finished difference. Result has 27 places, 0 transitions, 0 flow [2025-03-08 17:30:39,370 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-08 17:30:39,370 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2025-03-08 17:30:39,370 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 0 transitions, 0 flow [2025-03-08 17:30:39,370 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-08 17:30:39,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-08 17:30:39,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-08 17:30:39,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-08 17:30:39,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-08 17:30:39,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:30:39,374 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-03-08 17:30:39,377 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:30:39,377 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:30:39,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:30:39 BasicIcfg [2025-03-08 17:30:39,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:30:39,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:30:39,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:30:39,383 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:30:39,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:30:32" (3/4) ... [2025-03-08 17:30:39,386 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:30:39,388 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 17:30:39,388 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 17:30:39,388 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 17:30:39,390 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2025-03-08 17:30:39,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-03-08 17:30:39,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 17:30:39,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 17:30:39,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:30:39,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:30:39,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:30:39,449 INFO L158 Benchmark]: Toolchain (without parser) took 7329.33ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 113.0MB in the beginning and 315.0MB in the end (delta: -202.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2025-03-08 17:30:39,450 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory was 122.5MB in the beginning and 122.2MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:30:39,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.18ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:30:39,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.96ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:30:39,451 INFO L158 Benchmark]: Boogie Preprocessor took 28.70ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:30:39,452 INFO L158 Benchmark]: IcfgBuilder took 361.66ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 74.3MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 17:30:39,452 INFO L158 Benchmark]: TraceAbstraction took 6660.71ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 73.4MB in the beginning and 319.9MB in the end (delta: -246.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2025-03-08 17:30:39,452 INFO L158 Benchmark]: Witness Printer took 66.00ms. Allocated memory is still 394.3MB. Free memory was 319.9MB in the beginning and 315.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:30:39,454 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.17ms. Allocated memory is still 201.3MB. Free memory was 122.5MB in the beginning and 122.2MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.18ms. Allocated memory is still 142.6MB. Free memory was 113.0MB in the beginning and 101.4MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.96ms. Allocated memory is still 142.6MB. Free memory was 101.4MB in the beginning and 100.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.70ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 361.66ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 74.3MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6660.71ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 73.4MB in the beginning and 319.9MB in the end (delta: -246.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 66.00ms. Allocated memory is still 394.3MB. Free memory was 319.9MB in the beginning and 315.0MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 77]: 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, 28 edges, 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: 6.6s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 164 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 373 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 373 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=2, InterpolantAutomatonStates: 37, 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, 4.5s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 2249 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-08 17:30:39,469 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