./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.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-node-symm.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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:29:41,534 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:29:41,589 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:41,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:29:41,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:29:41,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:29:41,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:29:41,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:29:41,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:29:41,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:29:41,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:29:41,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:29:41,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:29:41,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:29:41,620 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:29:41,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:29:41,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:29:41,620 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:29:41,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:29:41,621 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:29:41,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:29:41,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:41,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:29:41,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:29:41,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:29:41,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:29:41,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:29:41,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:29:41,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:29:41,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:29:41,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:29:41,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:29:41,623 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-03-08 17:29:41,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:29:41,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:29:41,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:29:41,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:29:41,883 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:29:41,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-08 17:29:43,035 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31e87bc4/566a9eb6666841c5a90794a8f6478941/FLAG68092458e [2025-03-08 17:29:43,264 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:29:43,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-03-08 17:29:43,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31e87bc4/566a9eb6666841c5a90794a8f6478941/FLAG68092458e [2025-03-08 17:29:43,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31e87bc4/566a9eb6666841c5a90794a8f6478941 [2025-03-08 17:29:43,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:29:43,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:29:43,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:43,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:29:43,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:29:43,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:43" (1/1) ... [2025-03-08 17:29:43,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593a7904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43, skipping insertion in model container [2025-03-08 17:29:43,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:43" (1/1) ... [2025-03-08 17:29:43,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:29:43,739 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-node-symm.wvr.c[3331,3344] [2025-03-08 17:29:43,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:43,759 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:29:43,779 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-node-symm.wvr.c[3331,3344] [2025-03-08 17:29:43,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:43,800 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:29:43,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43 WrapperNode [2025-03-08 17:29:43,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:43,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:43,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:29:43,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:29:43,806 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:43" (1/1) ... [2025-03-08 17:29:43,811 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:43" (1/1) ... [2025-03-08 17:29:43,831 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 18, calls inlined = 24, statements flattened = 277 [2025-03-08 17:29:43,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:43,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:29:43,832 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:29:43,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:29:43,839 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:43" (1/1) ... [2025-03-08 17:29:43,840 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:43" (1/1) ... [2025-03-08 17:29:43,842 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:43" (1/1) ... [2025-03-08 17:29:43,857 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-03-08 17:29:43,857 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:43" (1/1) ... [2025-03-08 17:29:43,858 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:43" (1/1) ... [2025-03-08 17:29:43,867 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:43" (1/1) ... [2025-03-08 17:29:43,868 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:43" (1/1) ... [2025-03-08 17:29:43,870 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:43" (1/1) ... [2025-03-08 17:29:43,870 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:43" (1/1) ... [2025-03-08 17:29:43,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:29:43,874 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:29:43,874 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:29:43,874 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:29:43,875 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (1/1) ... [2025-03-08 17:29:43,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:43,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:43,910 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:43,914 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:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:29:43,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:29:43,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:29:43,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:29:43,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:29:43,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:29:43,933 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:44,033 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:29:44,035 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:29:44,417 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:29:44,417 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:29:44,722 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:29:44,722 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:29:44,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:44 BoogieIcfgContainer [2025-03-08 17:29:44,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:29:44,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:29:44,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:29:44,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:29:44,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:43" (1/3) ... [2025-03-08 17:29:44,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f798b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:44, skipping insertion in model container [2025-03-08 17:29:44,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:43" (2/3) ... [2025-03-08 17:29:44,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f798b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:44, skipping insertion in model container [2025-03-08 17:29:44,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:44" (3/3) ... [2025-03-08 17:29:44,732 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-03-08 17:29:44,746 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:29:44,747 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 19 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 17:29:44,747 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:29:44,796 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:29:44,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 22 transitions, 58 flow [2025-03-08 17:29:44,848 INFO L124 PetriNetUnfolderBase]: 4/20 cut-off events. [2025-03-08 17:29:44,851 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:29:44,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 20 events. 4/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-03-08 17:29:44,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 22 transitions, 58 flow [2025-03-08 17:29:44,856 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 50 flow [2025-03-08 17:29:44,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:29:44,875 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;@1617e547, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:29:44,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-08 17:29:44,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:29:44,884 INFO L124 PetriNetUnfolderBase]: 4/18 cut-off events. [2025-03-08 17:29:44,884 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 17:29:44,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:44,885 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:44,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:29:44,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash -570619463, now seen corresponding path program 1 times [2025-03-08 17:29:44,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:44,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357394992] [2025-03-08 17:29:44,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:44,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:44,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:29:45,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:29:45,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:45,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:45,348 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:45,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:45,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357394992] [2025-03-08 17:29:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357394992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:45,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:29:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974874389] [2025-03-08 17:29:45,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:45,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:29:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:45,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:29:45,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:29:45,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-08 17:29:45,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:45,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:45,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-08 17:29:45,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:45,436 INFO L124 PetriNetUnfolderBase]: 12/35 cut-off events. [2025-03-08 17:29:45,436 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:29:45,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 35 events. 12/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 8 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 40. Up to 34 conditions per place. [2025-03-08 17:29:45,437 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2025-03-08 17:29:45,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 20 transitions, 90 flow [2025-03-08 17:29:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:29:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:29:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-03-08 17:29:45,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2025-03-08 17:29:45,448 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 29 transitions. [2025-03-08 17:29:45,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 20 transitions, 90 flow [2025-03-08 17:29:45,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 17:29:45,453 INFO L231 Difference]: Finished difference. Result has 21 places, 20 transitions, 54 flow [2025-03-08 17:29:45,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=21, PETRI_TRANSITIONS=20} [2025-03-08 17:29:45,458 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2025-03-08 17:29:45,459 INFO L471 AbstractCegarLoop]: Abstraction has has 21 places, 20 transitions, 54 flow [2025-03-08 17:29:45,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:45,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:45,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:45,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:29:45,460 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:29:45,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2082162649, now seen corresponding path program 1 times [2025-03-08 17:29:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840074230] [2025-03-08 17:29:45,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:45,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:29:45,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:29:45,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:45,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:29:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840074230] [2025-03-08 17:29:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840074230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:45,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:29:45,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628236629] [2025-03-08 17:29:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:45,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:29:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:45,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:29:45,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:29:45,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-08 17:29:45,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:45,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:45,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-08 17:29:45,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:45,692 INFO L124 PetriNetUnfolderBase]: 12/36 cut-off events. [2025-03-08 17:29:45,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:29:45,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 36 events. 12/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 8 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 72. Up to 33 conditions per place. [2025-03-08 17:29:45,693 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 16 selfloop transitions, 4 changer transitions 0/21 dead transitions. [2025-03-08 17:29:45,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 21 transitions, 96 flow [2025-03-08 17:29:45,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:29:45,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:29:45,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-03-08 17:29:45,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-03-08 17:29:45,694 INFO L175 Difference]: Start difference. First operand has 21 places, 20 transitions, 54 flow. Second operand 4 states and 33 transitions. [2025-03-08 17:29:45,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 21 transitions, 96 flow [2025-03-08 17:29:45,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 92 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:45,695 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 68 flow [2025-03-08 17:29:45,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2025-03-08 17:29:45,695 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2025-03-08 17:29:45,695 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 68 flow [2025-03-08 17:29:45,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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:45,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:45,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:29:45,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:29:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash 54728978, now seen corresponding path program 1 times [2025-03-08 17:29:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697596574] [2025-03-08 17:29:45,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:45,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 17:29:45,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 17:29:45,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:45,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:29:45,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:45,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697596574] [2025-03-08 17:29:45,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697596574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:45,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:45,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:29:45,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847599060] [2025-03-08 17:29:45,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:45,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:29:45,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:45,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:29:45,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:29:45,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-08 17:29:45,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:45,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:45,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-08 17:29:45,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:45,913 INFO L124 PetriNetUnfolderBase]: 12/37 cut-off events. [2025-03-08 17:29:45,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:29:45,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 37 events. 12/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 8 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 72. Up to 35 conditions per place. [2025-03-08 17:29:45,916 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 18 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2025-03-08 17:29:45,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 22 transitions, 112 flow [2025-03-08 17:29:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:29:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:29:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-03-08 17:29:45,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-03-08 17:29:45,917 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 68 flow. Second operand 4 states and 32 transitions. [2025-03-08 17:29:45,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 22 transitions, 112 flow [2025-03-08 17:29:45,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:45,919 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 81 flow [2025-03-08 17:29:45,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=81, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2025-03-08 17:29:45,920 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 5 predicate places. [2025-03-08 17:29:45,920 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 81 flow [2025-03-08 17:29:45,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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:45,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:45,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:45,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:29:45,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:29:45,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:45,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2142432562, now seen corresponding path program 1 times [2025-03-08 17:29:45,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:45,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519347587] [2025-03-08 17:29:45,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:45,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 17:29:45,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 17:29:45,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:45,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:46,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 17:29:46,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:46,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519347587] [2025-03-08 17:29:46,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519347587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:46,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:46,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:29:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804259857] [2025-03-08 17:29:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:46,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:29:46,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:46,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:29:46,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:29:46,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-08 17:29:46,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:46,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:46,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-08 17:29:46,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:46,079 INFO L124 PetriNetUnfolderBase]: 12/38 cut-off events. [2025-03-08 17:29:46,079 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:29:46,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 38 events. 12/38 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 8 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 79. Up to 36 conditions per place. [2025-03-08 17:29:46,080 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 19 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2025-03-08 17:29:46,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 127 flow [2025-03-08 17:29:46,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:29:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:29:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-03-08 17:29:46,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2025-03-08 17:29:46,083 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 81 flow. Second operand 4 states and 32 transitions. [2025-03-08 17:29:46,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 127 flow [2025-03-08 17:29:46,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 121 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:29:46,084 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 89 flow [2025-03-08 17:29:46,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-03-08 17:29:46,085 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2025-03-08 17:29:46,085 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 89 flow [2025-03-08 17:29:46,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:46,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:46,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:29:46,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:29:46,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash 981586748, now seen corresponding path program 1 times [2025-03-08 17:29:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:46,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001746464] [2025-03-08 17:29:46,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:46,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:46,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:29:46,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:29:46,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:46,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 17:29:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001746464] [2025-03-08 17:29:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001746464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:29:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614396524] [2025-03-08 17:29:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:47,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:29:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:29:47,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:29:47,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-08 17:29:47,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:47,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:47,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-08 17:29:47,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:47,409 INFO L124 PetriNetUnfolderBase]: 11/41 cut-off events. [2025-03-08 17:29:47,410 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 17:29:47,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 41 events. 11/41 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 1 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 88. Up to 21 conditions per place. [2025-03-08 17:29:47,412 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 22 selfloop transitions, 1 changer transitions 6/30 dead transitions. [2025-03-08 17:29:47,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 164 flow [2025-03-08 17:29:47,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:29:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:29:47,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2025-03-08 17:29:47,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2025-03-08 17:29:47,414 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 89 flow. Second operand 4 states and 38 transitions. [2025-03-08 17:29:47,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 164 flow [2025-03-08 17:29:47,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 158 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:29:47,415 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 90 flow [2025-03-08 17:29:47,415 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-03-08 17:29:47,416 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2025-03-08 17:29:47,416 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 90 flow [2025-03-08 17:29:47,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:47,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:47,416 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:29:47,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:29:47,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:29:47,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:47,417 INFO L85 PathProgramCache]: Analyzing trace with hash 655163120, now seen corresponding path program 2 times [2025-03-08 17:29:47,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:47,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497141653] [2025-03-08 17:29:47,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:29:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:47,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 17:29:47,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 19 statements. [2025-03-08 17:29:47,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:47,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 17:29:48,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:48,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497141653] [2025-03-08 17:29:48,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497141653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:48,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:48,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:29:48,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085257041] [2025-03-08 17:29:48,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:48,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:29:48,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:48,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:29:48,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:29:48,003 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2025-03-08 17:29:48,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:48,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:48,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2025-03-08 17:29:48,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:48,097 INFO L124 PetriNetUnfolderBase]: 9/33 cut-off events. [2025-03-08 17:29:48,097 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 17:29:48,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 33 events. 9/33 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 3 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 94. Up to 26 conditions per place. [2025-03-08 17:29:48,097 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 0 selfloop transitions, 0 changer transitions 25/25 dead transitions. [2025-03-08 17:29:48,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 146 flow [2025-03-08 17:29:48,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:29:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:29:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-03-08 17:29:48,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2025-03-08 17:29:48,098 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 90 flow. Second operand 4 states and 34 transitions. [2025-03-08 17:29:48,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 146 flow [2025-03-08 17:29:48,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:48,099 INFO L231 Difference]: Finished difference. Result has 31 places, 0 transitions, 0 flow [2025-03-08 17:29:48,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=31, PETRI_TRANSITIONS=0} [2025-03-08 17:29:48,099 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2025-03-08 17:29:48,099 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 0 transitions, 0 flow [2025-03-08 17:29:48,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:48,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-03-08 17:29:48,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-03-08 17:29:48,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-03-08 17:29:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 17:29:48,103 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1] [2025-03-08 17:29:48,106 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 17:29:48,106 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:29:48,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:29:48 BasicIcfg [2025-03-08 17:29:48,111 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:29:48,111 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:29:48,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:29:48,112 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:29:48,112 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:44" (3/4) ... [2025-03-08 17:29:48,113 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 17:29:48,115 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 17:29:48,116 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 17:29:48,124 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 156 nodes and edges [2025-03-08 17:29:48,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 75 nodes and edges [2025-03-08 17:29:48,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2025-03-08 17:29:48,126 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 17:29:48,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 17:29:48,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 17:29:48,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:29:48,195 INFO L158 Benchmark]: Toolchain (without parser) took 4587.44ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 123.7MB in the beginning and 150.5MB in the end (delta: -26.8MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2025-03-08 17:29:48,196 INFO L158 Benchmark]: CDTParser took 0.95ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:48,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.29ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 110.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:29:48,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.98ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:29:48,197 INFO L158 Benchmark]: Boogie Preprocessor took 41.38ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 105.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:29:48,197 INFO L158 Benchmark]: IcfgBuilder took 848.61ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 97.4MB in the end (delta: 8.3MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2025-03-08 17:29:48,197 INFO L158 Benchmark]: TraceAbstraction took 3385.76ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 96.5MB in the beginning and 158.9MB in the end (delta: -62.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2025-03-08 17:29:48,198 INFO L158 Benchmark]: Witness Printer took 83.39ms. Allocated memory is still 276.8MB. Free memory was 158.9MB in the beginning and 150.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:29:48,199 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.95ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.29ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 110.8MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.98ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 108.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.38ms. Allocated memory is still 167.8MB. Free memory was 108.5MB in the beginning and 105.8MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 848.61ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 97.4MB in the end (delta: 8.3MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3385.76ms. Allocated memory was 167.8MB in the beginning and 276.8MB in the end (delta: 109.1MB). Free memory was 96.5MB in the beginning and 158.9MB in the end (delta: -62.4MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. * Witness Printer took 83.39ms. Allocated memory is still 276.8MB. Free memory was 158.9MB in the beginning and 150.5MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 25 locations, 28 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 0 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 2.3s InterpolantComputationTime, 104 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 822 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 14/14 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:48,216 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