./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/array-eq-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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:40:28,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:40:28,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:40:28,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:40:28,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:40:28,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:40:28,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:40:28,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:40:28,761 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:40:28,761 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:40:28,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:40:28,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:40:28,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:40:28,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:40:28,762 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:40:28,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:40:28,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:40:28,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:40:28,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:40:28,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:40:28,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:40:28,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:40:28,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:28,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:40:28,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:40:28,765 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-03-13 21:40:28,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:40:28,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:40:28,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:40:28,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:40:28,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:40:28,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-13 21:40:30,096 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34650427c/a742302c73cc4b6c9642d14d80690506/FLAGba0984350 [2025-03-13 21:40:30,354 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:40:30,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-03-13 21:40:30,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34650427c/a742302c73cc4b6c9642d14d80690506/FLAGba0984350 [2025-03-13 21:40:30,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34650427c/a742302c73cc4b6c9642d14d80690506 [2025-03-13 21:40:30,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:40:30,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:40:30,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:30,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:40:30,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:40:30,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10652a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30, skipping insertion in model container [2025-03-13 21:40:30,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:40:30,789 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/array-eq-trans.wvr.c[2776,2789] [2025-03-13 21:40:30,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:30,801 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:40:30,815 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/array-eq-trans.wvr.c[2776,2789] [2025-03-13 21:40:30,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:40:30,828 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:40:30,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30 WrapperNode [2025-03-13 21:40:30,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:40:30,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:30,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:40:30,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:40:30,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,855 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 185 [2025-03-13 21:40:30,855 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:40:30,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:40:30,856 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:40:30,856 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:40:30,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,874 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-13 21:40:30,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,875 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:40:30,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:40:30,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:40:30,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:40:30,892 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (1/1) ... [2025-03-13 21:40:30,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:40:30,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:30,913 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 21:40:30,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:40:30,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:40:30,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 21:40:30,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:40:30,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:40:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:40:30,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:40:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:40:30,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:40:30,931 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:40:31,017 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:40:31,018 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:40:31,407 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:40:31,408 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:40:31,408 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:40:31,686 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:40:31,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:31 BoogieIcfgContainer [2025-03-13 21:40:31,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:40:31,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:40:31,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:40:31,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:40:31,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:40:30" (1/3) ... [2025-03-13 21:40:31,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3b81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:31, skipping insertion in model container [2025-03-13 21:40:31,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:40:30" (2/3) ... [2025-03-13 21:40:31,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa3b81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:40:31, skipping insertion in model container [2025-03-13 21:40:31,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:40:31" (3/3) ... [2025-03-13 21:40:31,692 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-03-13 21:40:31,701 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:40:31,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-13 21:40:31,702 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:40:31,735 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-13 21:40:31,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-03-13 21:40:31,780 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-03-13 21:40:31,783 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:40:31,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-13 21:40:31,785 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-03-13 21:40:31,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-03-13 21:40:31,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:40:31,805 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;@1ea3141e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:40:31,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-13 21:40:31,815 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:40:31,815 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-03-13 21:40:31,815 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:40:31,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:31,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:31,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:31,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1511072373, now seen corresponding path program 1 times [2025-03-13 21:40:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095054445] [2025-03-13 21:40:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:31,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:31,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-13 21:40:31,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-13 21:40:31,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:31,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:32,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095054445] [2025-03-13 21:40:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095054445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:32,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:40:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470741280] [2025-03-13 21:40:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:32,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:40:32,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:32,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:40:32,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:40:32,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-03-13 21:40:32,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:32,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:32,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-03-13 21:40:32,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:32,805 INFO L124 PetriNetUnfolderBase]: 1319/1875 cut-off events. [2025-03-13 21:40:32,806 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-13 21:40:32,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 1875 events. 1319/1875 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8699 event pairs, 745 based on Foata normal form. 32/1595 useless extension candidates. Maximal degree in co-relation 2273. Up to 1164 conditions per place. [2025-03-13 21:40:32,826 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 28 selfloop transitions, 2 changer transitions 27/64 dead transitions. [2025-03-13 21:40:32,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 278 flow [2025-03-13 21:40:32,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:32,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-03-13 21:40:32,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.545 [2025-03-13 21:40:32,839 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 5 states and 109 transitions. [2025-03-13 21:40:32,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 278 flow [2025-03-13 21:40:32,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-13 21:40:32,851 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 102 flow [2025-03-13 21:40:32,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2025-03-13 21:40:32,857 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-03-13 21:40:32,858 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 102 flow [2025-03-13 21:40:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:32,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:32,858 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:32,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:40:32,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:32,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 787845435, now seen corresponding path program 1 times [2025-03-13 21:40:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785055397] [2025-03-13 21:40:32,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:32,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:40:32,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:40:32,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:32,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:33,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:33,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785055397] [2025-03-13 21:40:33,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785055397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:33,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070756229] [2025-03-13 21:40:33,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:33,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:33,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:40:33,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:40:33,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:40:33,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:33,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:33,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:40:33,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:33,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:33,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:33,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:40:33,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2025-03-13 21:40:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:40:33,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070756229] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:33,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:40:33,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-03-13 21:40:33,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69128991] [2025-03-13 21:40:33,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:33,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:40:33,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:33,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:40:33,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-13 21:40:33,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-13 21:40:33,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:33,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:33,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-13 21:40:33,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:33,937 INFO L124 PetriNetUnfolderBase]: 1708/2369 cut-off events. [2025-03-13 21:40:33,937 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2025-03-13 21:40:33,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4923 conditions, 2369 events. 1708/2369 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 10898 event pairs, 476 based on Foata normal form. 1/1914 useless extension candidates. Maximal degree in co-relation 4910. Up to 940 conditions per place. [2025-03-13 21:40:33,949 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 62 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2025-03-13 21:40:33,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 328 flow [2025-03-13 21:40:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-13 21:40:33,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.57 [2025-03-13 21:40:33,951 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 102 flow. Second operand 5 states and 114 transitions. [2025-03-13 21:40:33,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 328 flow [2025-03-13 21:40:33,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 74 transitions, 306 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-13 21:40:33,953 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 114 flow [2025-03-13 21:40:33,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-03-13 21:40:33,953 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-03-13 21:40:33,953 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 114 flow [2025-03-13 21:40:33,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:33,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:33,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:33,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:40:34,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:34,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:34,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:34,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1616225492, now seen corresponding path program 1 times [2025-03-13 21:40:34,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:34,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430464841] [2025-03-13 21:40:34,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:34,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 21:40:34,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 21:40:34,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:34,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:34,273 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-13 21:40:34,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:34,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430464841] [2025-03-13 21:40:34,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430464841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:34,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:34,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:40:34,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300229484] [2025-03-13 21:40:34,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:34,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:40:34,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:34,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:40:34,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:40:34,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-03-13 21:40:34,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:34,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:34,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-03-13 21:40:34,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:34,575 INFO L124 PetriNetUnfolderBase]: 2248/3220 cut-off events. [2025-03-13 21:40:34,575 INFO L125 PetriNetUnfolderBase]: For 355/363 co-relation queries the response was YES. [2025-03-13 21:40:34,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6785 conditions, 3220 events. 2248/3220 cut-off events. For 355/363 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 16738 event pairs, 771 based on Foata normal form. 53/2893 useless extension candidates. Maximal degree in co-relation 6765. Up to 1406 conditions per place. [2025-03-13 21:40:34,591 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 48 selfloop transitions, 4 changer transitions 23/83 dead transitions. [2025-03-13 21:40:34,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 369 flow [2025-03-13 21:40:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:40:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:40:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-13 21:40:34,593 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-13 21:40:34,593 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 114 flow. Second operand 6 states and 135 transitions. [2025-03-13 21:40:34,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 369 flow [2025-03-13 21:40:34,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:40:34,595 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 146 flow [2025-03-13 21:40:34,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-13 21:40:34,596 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2025-03-13 21:40:34,596 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 146 flow [2025-03-13 21:40:34,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:34,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:34,596 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:34,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:40:34,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:34,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -914441705, now seen corresponding path program 1 times [2025-03-13 21:40:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:34,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13022166] [2025-03-13 21:40:34,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:34,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:40:34,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:40:34,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:34,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:34,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:40:34,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:34,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13022166] [2025-03-13 21:40:34,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13022166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:34,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213621518] [2025-03-13 21:40:34,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:34,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:34,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:34,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:34,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:40:34,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:40:34,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:40:34,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:34,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:34,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:40:34,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:40:35,087 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:35,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:40:35,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 55 [2025-03-13 21:40:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:40:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213621518] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:40:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 12 [2025-03-13 21:40:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898430420] [2025-03-13 21:40:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:35,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:35,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:40:35,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-13 21:40:35,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:35,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:35,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-13 21:40:35,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:35,803 INFO L124 PetriNetUnfolderBase]: 4357/6188 cut-off events. [2025-03-13 21:40:35,804 INFO L125 PetriNetUnfolderBase]: For 2827/2961 co-relation queries the response was YES. [2025-03-13 21:40:35,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13974 conditions, 6188 events. 4357/6188 cut-off events. For 2827/2961 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 34530 event pairs, 1029 based on Foata normal form. 3/5262 useless extension candidates. Maximal degree in co-relation 13947. Up to 1821 conditions per place. [2025-03-13 21:40:35,827 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 81 selfloop transitions, 7 changer transitions 3/98 dead transitions. [2025-03-13 21:40:35,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 98 transitions, 521 flow [2025-03-13 21:40:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:40:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:40:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-03-13 21:40:35,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-03-13 21:40:35,829 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 146 flow. Second operand 7 states and 146 transitions. [2025-03-13 21:40:35,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 98 transitions, 521 flow [2025-03-13 21:40:35,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 502 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-03-13 21:40:35,834 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 170 flow [2025-03-13 21:40:35,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-03-13 21:40:35,836 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2025-03-13 21:40:35,836 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 170 flow [2025-03-13 21:40:35,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:35,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:35,837 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:35,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 21:40:36,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-13 21:40:36,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:36,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:36,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1360765694, now seen corresponding path program 1 times [2025-03-13 21:40:36,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:36,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743419580] [2025-03-13 21:40:36,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:36,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:36,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:40:36,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:40:36,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:36,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:36,163 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-13 21:40:36,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:36,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743419580] [2025-03-13 21:40:36,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743419580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:36,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:40:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677890158] [2025-03-13 21:40:36,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:36,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:40:36,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:36,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:40:36,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:40:36,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-03-13 21:40:36,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:36,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:36,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-03-13 21:40:36,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:36,561 INFO L124 PetriNetUnfolderBase]: 4149/6162 cut-off events. [2025-03-13 21:40:36,561 INFO L125 PetriNetUnfolderBase]: For 3047/3169 co-relation queries the response was YES. [2025-03-13 21:40:36,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14301 conditions, 6162 events. 4149/6162 cut-off events. For 3047/3169 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 37068 event pairs, 1700 based on Foata normal form. 126/5876 useless extension candidates. Maximal degree in co-relation 14271. Up to 2693 conditions per place. [2025-03-13 21:40:36,586 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 51 selfloop transitions, 4 changer transitions 21/85 dead transitions. [2025-03-13 21:40:36,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 85 transitions, 454 flow [2025-03-13 21:40:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:40:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:40:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-03-13 21:40:36,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.595 [2025-03-13 21:40:36,588 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 170 flow. Second operand 5 states and 119 transitions. [2025-03-13 21:40:36,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 85 transitions, 454 flow [2025-03-13 21:40:36,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:40:36,595 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 184 flow [2025-03-13 21:40:36,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=184, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-03-13 21:40:36,596 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-03-13 21:40:36,597 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 184 flow [2025-03-13 21:40:36,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:36,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:36,597 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:36,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:40:36,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:36,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:36,598 INFO L85 PathProgramCache]: Analyzing trace with hash -307655342, now seen corresponding path program 1 times [2025-03-13 21:40:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:36,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096878361] [2025-03-13 21:40:36,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:36,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:40:36,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:40:36,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:36,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:36,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:40:36,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:36,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096878361] [2025-03-13 21:40:36,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096878361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:36,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772179931] [2025-03-13 21:40:36,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:36,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:36,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:36,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:36,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:40:36,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 21:40:36,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 21:40:36,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:36,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:36,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-13 21:40:36,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:40:36,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:40:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772179931] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:40:37,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-03-13 21:40:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371772740] [2025-03-13 21:40:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:37,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:40:37,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:37,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:40:37,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:40:37,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-03-13 21:40:37,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:37,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:37,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-03-13 21:40:37,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:37,778 INFO L124 PetriNetUnfolderBase]: 6384/9350 cut-off events. [2025-03-13 21:40:37,778 INFO L125 PetriNetUnfolderBase]: For 7272/7483 co-relation queries the response was YES. [2025-03-13 21:40:37,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22928 conditions, 9350 events. 6384/9350 cut-off events. For 7272/7483 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 55934 event pairs, 2331 based on Foata normal form. 0/8512 useless extension candidates. Maximal degree in co-relation 22896. Up to 3821 conditions per place. [2025-03-13 21:40:37,806 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 69 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-13 21:40:37,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 496 flow [2025-03-13 21:40:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:40:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:40:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2025-03-13 21:40:37,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2025-03-13 21:40:37,808 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 184 flow. Second operand 7 states and 127 transitions. [2025-03-13 21:40:37,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 496 flow [2025-03-13 21:40:37,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 484 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-13 21:40:37,813 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 206 flow [2025-03-13 21:40:37,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=206, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2025-03-13 21:40:37,815 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2025-03-13 21:40:37,815 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 206 flow [2025-03-13 21:40:37,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:37,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:37,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:37,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:40:38,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:38,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:38,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 509543411, now seen corresponding path program 1 times [2025-03-13 21:40:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:38,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86118251] [2025-03-13 21:40:38,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:38,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:40:38,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:40:38,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:38,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:38,836 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-13 21:40:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:38,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86118251] [2025-03-13 21:40:38,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86118251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:40:38,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:40:38,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-13 21:40:38,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813658282] [2025-03-13 21:40:38,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:40:38,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:40:38,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:40:38,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:40:38,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:40:38,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-03-13 21:40:38,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 206 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:38,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:40:38,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-03-13 21:40:38,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:40:39,597 INFO L124 PetriNetUnfolderBase]: 9303/13428 cut-off events. [2025-03-13 21:40:39,598 INFO L125 PetriNetUnfolderBase]: For 10902/10902 co-relation queries the response was YES. [2025-03-13 21:40:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35808 conditions, 13428 events. 9303/13428 cut-off events. For 10902/10902 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 78911 event pairs, 2563 based on Foata normal form. 23/13433 useless extension candidates. Maximal degree in co-relation 35773. Up to 11743 conditions per place. [2025-03-13 21:40:39,649 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 13 changer transitions 11/104 dead transitions. [2025-03-13 21:40:39,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 104 transitions, 599 flow [2025-03-13 21:40:39,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:40:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:40:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-03-13 21:40:39,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-03-13 21:40:39,650 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 206 flow. Second operand 6 states and 134 transitions. [2025-03-13 21:40:39,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 104 transitions, 599 flow [2025-03-13 21:40:39,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 104 transitions, 593 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:40:39,671 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 312 flow [2025-03-13 21:40:39,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-03-13 21:40:39,671 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-03-13 21:40:39,672 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 312 flow [2025-03-13 21:40:39,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:40:39,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:40:39,672 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:40:39,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:40:39,672 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-13 21:40:39,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:40:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2213725, now seen corresponding path program 1 times [2025-03-13 21:40:39,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:40:39,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315859790] [2025-03-13 21:40:39,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:39,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:40:39,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:40:39,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:40:39,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:39,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:40:40,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:40:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315859790] [2025-03-13 21:40:40,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315859790] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:40:40,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038195255] [2025-03-13 21:40:40,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:40:40,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:40:40,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:40:40,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:40:40,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:40:40,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:40:40,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:40:40,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:40:40,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:40:40,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:40:40,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:40:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:40:40,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:40:41,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:40:41,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 122 treesize of output 485