./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-match-trans.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-match-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 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:29:36,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:29:36,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:29:36,465 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:29:36,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:29:36,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:29:36,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:29:36,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:29:36,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:29:36,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:29:36,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:29:36,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:29:36,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:29:36,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:29:36,488 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:29:36,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:29:36,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:29:36,492 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:29:36,493 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:36,493 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:29:36,493 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:29:36,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:29:36,494 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:29:36,494 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:29:36,494 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:29:36,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:29:36,494 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 -> 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 [2025-03-08 17:29:36,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:29:36,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:29:36,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:29:36,731 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:29:36,731 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:29:36,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-03-08 17:29:37,884 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951ca9a83/30269be4396b439cb8717455a0cadcc2/FLAG0df7a643d [2025-03-08 17:29:38,073 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:29:38,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-03-08 17:29:38,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951ca9a83/30269be4396b439cb8717455a0cadcc2/FLAG0df7a643d [2025-03-08 17:29:38,439 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/951ca9a83/30269be4396b439cb8717455a0cadcc2 [2025-03-08 17:29:38,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:29:38,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:29:38,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:38,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:29:38,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:29:38,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f77fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38, skipping insertion in model container [2025-03-08 17:29:38,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,457 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:29:38,578 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-match-trans.wvr.c[2993,3006] [2025-03-08 17:29:38,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:38,593 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:29:38,612 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-match-trans.wvr.c[2993,3006] [2025-03-08 17:29:38,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:38,628 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:29:38,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38 WrapperNode [2025-03-08 17:29:38,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:38,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:38,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:29:38,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:29:38,635 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:29:38" (1/1) ... [2025-03-08 17:29:38,641 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:29:38" (1/1) ... [2025-03-08 17:29:38,663 INFO L138 Inliner]: procedures = 22, calls = 18, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 195 [2025-03-08 17:29:38,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:38,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:29:38,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:29:38,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:29:38,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,692 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:29:38,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:29:38,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:29:38,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:29:38,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:29:38,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (1/1) ... [2025-03-08 17:29:38,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:38,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:38,742 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:29:38,743 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:29:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:29:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:29:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:29:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:29:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:29:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:29:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:29:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:29:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:29:38,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:29:38,760 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:29:38,833 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:29:38,834 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:29:39,067 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:29:39,068 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:29:39,320 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:29:39,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:29:39,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:39 BoogieIcfgContainer [2025-03-08 17:29:39,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:29:39,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:29:39,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:29:39,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:29:39,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:38" (1/3) ... [2025-03-08 17:29:39,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af8261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:39, skipping insertion in model container [2025-03-08 17:29:39,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:38" (2/3) ... [2025-03-08 17:29:39,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af8261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:39, skipping insertion in model container [2025-03-08 17:29:39,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:39" (3/3) ... [2025-03-08 17:29:39,329 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2025-03-08 17:29:39,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:29:39,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-trans.wvr.c that has 4 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 17:29:39,343 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:29:39,378 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:29:39,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 19 transitions, 59 flow [2025-03-08 17:29:39,428 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-03-08 17:29:39,432 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:29:39,434 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-08 17:29:39,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 19 transitions, 59 flow [2025-03-08 17:29:39,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 15 transitions, 48 flow [2025-03-08 17:29:39,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:29:39,450 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;@63acf585, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:29:39,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:29:39,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:29:39,462 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-03-08 17:29:39,462 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:29:39,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:39,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:39,463 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:29:39,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:39,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1747409276, now seen corresponding path program 1 times [2025-03-08 17:29:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106955979] [2025-03-08 17:29:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:39,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:29:39,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:29:39,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:39,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:40,240 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:29:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106955979] [2025-03-08 17:29:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106955979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:40,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:40,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:40,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974492548] [2025-03-08 17:29:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:40,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:40,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:40,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:40,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:40,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:29:40,272 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-08 17:29:40,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:40,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:29:40,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:40,456 INFO L124 PetriNetUnfolderBase]: 32/85 cut-off events. [2025-03-08 17:29:40,457 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-08 17:29:40,459 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 226 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-08 17:29:40,461 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 26 selfloop transitions, 6 changer transitions 5/38 dead transitions. [2025-03-08 17:29:40,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 198 flow [2025-03-08 17:29:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-03-08 17:29:40,472 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-03-08 17:29:40,474 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 48 flow. Second operand 6 states and 62 transitions. [2025-03-08 17:29:40,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 198 flow [2025-03-08 17:29:40,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:29:40,481 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 69 flow [2025-03-08 17:29:40,482 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-08 17:29:40,485 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2025-03-08 17:29:40,485 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 69 flow [2025-03-08 17:29:40,485 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:29:40,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:40,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:40,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:29:40,485 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:29:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1760584542, now seen corresponding path program 2 times [2025-03-08 17:29:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:40,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57828839] [2025-03-08 17:29:40,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:29:40,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:40,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:29:40,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:29:40,518 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:40,880 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:29:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57828839] [2025-03-08 17:29:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57828839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23444055] [2025-03-08 17:29:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:40,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:40,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:29:40,884 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-08 17:29:40,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:40,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:29:40,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:41,030 INFO L124 PetriNetUnfolderBase]: 32/100 cut-off events. [2025-03-08 17:29:41,032 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-08 17:29:41,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 100 events. 32/100 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 348 event pairs, 6 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 264. Up to 48 conditions per place. [2025-03-08 17:29:41,034 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 24 selfloop transitions, 9 changer transitions 3/37 dead transitions. [2025-03-08 17:29:41,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 37 transitions, 197 flow [2025-03-08 17:29:41,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:29:41,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:29:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-03-08 17:29:41,036 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2025-03-08 17:29:41,036 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 69 flow. Second operand 5 states and 54 transitions. [2025-03-08 17:29:41,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 37 transitions, 197 flow [2025-03-08 17:29:41,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 193 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:41,039 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 116 flow [2025-03-08 17:29:41,039 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=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2025-03-08 17:29:41,040 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2025-03-08 17:29:41,040 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 116 flow [2025-03-08 17:29:41,040 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:29:41,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:41,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:29:41,041 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:29:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash -881154222, now seen corresponding path program 3 times [2025-03-08 17:29:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:41,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999941230] [2025-03-08 17:29:41,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:29:41,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:41,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:29:41,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:29:41,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:29:41,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:41,289 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:29:41,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:41,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999941230] [2025-03-08 17:29:41,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999941230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:41,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:41,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:41,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432319646] [2025-03-08 17:29:41,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:41,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:41,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:41,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:41,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:41,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:29:41,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 116 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:29:41,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:41,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:29:41,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:41,418 INFO L124 PetriNetUnfolderBase]: 32/98 cut-off events. [2025-03-08 17:29:41,418 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2025-03-08 17:29:41,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 98 events. 32/98 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 322 event pairs, 6 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 197. Up to 44 conditions per place. [2025-03-08 17:29:41,419 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 19 selfloop transitions, 8 changer transitions 9/37 dead transitions. [2025-03-08 17:29:41,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 241 flow [2025-03-08 17:29:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:29:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:29:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-08 17:29:41,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5473684210526316 [2025-03-08 17:29:41,423 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 116 flow. Second operand 5 states and 52 transitions. [2025-03-08 17:29:41,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 241 flow [2025-03-08 17:29:41,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 234 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:41,424 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 120 flow [2025-03-08 17:29:41,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2025-03-08 17:29:41,425 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2025-03-08 17:29:41,425 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 120 flow [2025-03-08 17:29:41,425 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:29:41,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:41,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:41,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:29:41,425 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:29:41,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:41,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1149100078, now seen corresponding path program 4 times [2025-03-08 17:29:41,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138139326] [2025-03-08 17:29:41,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:29:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:41,431 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-08 17:29:41,439 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:29:41,439 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:29:41,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:41,654 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:29:41,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:41,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138139326] [2025-03-08 17:29:41,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138139326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:41,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:41,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:41,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823774905] [2025-03-08 17:29:41,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:41,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:41,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:41,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:41,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:29:41,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 120 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:29:41,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:41,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:29:41,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:41,748 INFO L124 PetriNetUnfolderBase]: 16/54 cut-off events. [2025-03-08 17:29:41,748 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-08 17:29:41,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 54 events. 16/54 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 130 event pairs, 2 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 162. Up to 22 conditions per place. [2025-03-08 17:29:41,749 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 16 selfloop transitions, 5 changer transitions 8/30 dead transitions. [2025-03-08 17:29:41,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 211 flow [2025-03-08 17:29:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:29:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:29:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-03-08 17:29:41,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2025-03-08 17:29:41,750 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 120 flow. Second operand 5 states and 47 transitions. [2025-03-08 17:29:41,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 211 flow [2025-03-08 17:29:41,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 173 flow, removed 4 selfloop flow, removed 7 redundant places. [2025-03-08 17:29:41,752 INFO L231 Difference]: Finished difference. Result has 33 places, 18 transitions, 86 flow [2025-03-08 17:29:41,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2025-03-08 17:29:41,752 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2025-03-08 17:29:41,752 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 18 transitions, 86 flow [2025-03-08 17:29:41,752 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:29:41,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:41,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:41,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:29:41,753 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:29:41,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:41,753 INFO L85 PathProgramCache]: Analyzing trace with hash 555970662, now seen corresponding path program 5 times [2025-03-08 17:29:41,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:41,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681016624] [2025-03-08 17:29:41,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:29:41,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:41,761 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:29:41,772 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:29:41,772 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:41,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:41,932 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:29:41,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:41,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681016624] [2025-03-08 17:29:41,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681016624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:41,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:41,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297063949] [2025-03-08 17:29:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:41,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:41,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:41,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:41,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:29:41,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 18 transitions, 86 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:29:41,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:41,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:29:41,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:42,021 INFO L124 PetriNetUnfolderBase]: 8/37 cut-off events. [2025-03-08 17:29:42,021 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-08 17:29:42,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 37 events. 8/37 cut-off events. For 32/32 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 77. Up to 17 conditions per place. [2025-03-08 17:29:42,022 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 13 selfloop transitions, 3 changer transitions 10/27 dead transitions. [2025-03-08 17:29:42,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 160 flow [2025-03-08 17:29:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2025-03-08 17:29:42,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4473684210526316 [2025-03-08 17:29:42,023 INFO L175 Difference]: Start difference. First operand has 33 places, 18 transitions, 86 flow. Second operand 6 states and 51 transitions. [2025-03-08 17:29:42,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 160 flow [2025-03-08 17:29:42,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 135 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-08 17:29:42,024 INFO L231 Difference]: Finished difference. Result has 32 places, 15 transitions, 53 flow [2025-03-08 17:29:42,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=53, PETRI_PLACES=32, PETRI_TRANSITIONS=15} [2025-03-08 17:29:42,024 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2025-03-08 17:29:42,024 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 15 transitions, 53 flow [2025-03-08 17:29:42,024 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:29:42,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:42,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:42,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:29:42,024 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:29:42,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1411277316, now seen corresponding path program 6 times [2025-03-08 17:29:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037603458] [2025-03-08 17:29:42,025 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:29:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:42,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:29:42,037 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:29:42,037 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:29:42,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:42,186 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:29:42,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:42,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037603458] [2025-03-08 17:29:42,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037603458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:42,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:42,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:29:42,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386454609] [2025-03-08 17:29:42,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:42,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:29:42,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:42,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:29:42,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:29:42,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 19 [2025-03-08 17:29:42,188 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:29:42,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:42,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 19 [2025-03-08 17:29:42,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:42,268 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2025-03-08 17:29:42,268 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 17:29:42,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 19 events. 3/19 cut-off events. For 4/4 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:29:42,269 INFO L140 encePairwiseOnDemand]: 14/19 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2025-03-08 17:29:42,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 16 transitions, 85 flow [2025-03-08 17:29:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2025-03-08 17:29:42,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35964912280701755 [2025-03-08 17:29:42,269 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:29:42,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 16 transitions, 85 flow [2025-03-08 17:29:42,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 16 transitions, 71 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 17:29:42,271 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2025-03-08 17:29:42,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=21, 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=26, PETRI_TRANSITIONS=0} [2025-03-08 17:29:42,271 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2025-03-08 17:29:42,271 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 0 transitions, 0 flow [2025-03-08 17:29:42,271 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:29:42,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-03-08 17:29:42,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-03-08 17:29:42,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-08 17:29:42,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-08 17:29:42,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:29:42,274 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-03-08 17:29:42,276 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:29:42,276 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:29:42,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:29:42 BasicIcfg [2025-03-08 17:29:42,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:29:42,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:29:42,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:29:42,280 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:29:42,280 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:39" (3/4) ... [2025-03-08 17:29:42,282 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:29:42,283 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 17:29:42,284 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 17:29:42,284 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 17:29:42,286 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-03-08 17:29:42,286 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-08 17:29:42,286 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-08 17:29:42,286 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 17:29:42,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:29:42,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:29:42,333 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:29:42,334 INFO L158 Benchmark]: Toolchain (without parser) took 3892.08ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 113.6MB in the beginning and 329.1MB in the end (delta: -215.6MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2025-03-08 17:29:42,334 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:42,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.73ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 101.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:29:42,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.05ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:42,334 INFO L158 Benchmark]: Boogie Preprocessor took 46.86ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:29:42,335 INFO L158 Benchmark]: IcfgBuilder took 608.45ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.0MB in the end (delta: 3.6MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-03-08 17:29:42,335 INFO L158 Benchmark]: TraceAbstraction took 2956.51ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 93.2MB in the beginning and 333.2MB in the end (delta: -240.0MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-03-08 17:29:42,335 INFO L158 Benchmark]: Witness Printer took 53.61ms. Allocated memory is still 427.8MB. Free memory was 333.2MB in the beginning and 329.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:42,336 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.47ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.73ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 101.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.05ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 99.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.86ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 97.6MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 608.45ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 94.0MB in the end (delta: 3.6MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2956.51ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 93.2MB in the beginning and 333.2MB in the end (delta: -240.0MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Witness Printer took 53.61ms. Allocated memory is still 427.8MB. Free memory was 333.2MB in the beginning and 329.1MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 88]: 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: 2.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 292 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 0 mSDtfsCounter, 292 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=3, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 700 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:29:42,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE