./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 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/popl20-more-vector-add.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 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:08:39,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:08:39,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 01:08:39,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:08:39,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:08:39,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:08:39,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:08:39,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:08:39,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 01:08:39,328 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 01:08:39,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:08:39,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:08:39,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:08:39,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:08:39,329 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:08:39,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:08:39,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:08:39,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:08:39,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:08:39,330 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:08:39,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:08:39,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:08:39,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:08:39,331 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 -> 63e73d2abe89b782ca9e5c579baa72b5461ffc3c60c322f6f03d18cdd5548702 [2025-03-14 01:08:39,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:08:39,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:08:39,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:08:39,560 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:08:39,560 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:08:39,561 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-14 01:08:40,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f35dbd38/53fb0b062ff941138a4b31bdcb50bcf8/FLAGf6dc79c3b [2025-03-14 01:08:40,919 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:08:40,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-vector-add.wvr.c [2025-03-14 01:08:40,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f35dbd38/53fb0b062ff941138a4b31bdcb50bcf8/FLAGf6dc79c3b [2025-03-14 01:08:40,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f35dbd38/53fb0b062ff941138a4b31bdcb50bcf8 [2025-03-14 01:08:40,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:08:40,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:08:40,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:08:40,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:08:40,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:08:40,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:08:40" (1/1) ... [2025-03-14 01:08:40,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580f6288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:40, skipping insertion in model container [2025-03-14 01:08:40,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:08:40" (1/1) ... [2025-03-14 01:08:41,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:08:41,125 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/popl20-more-vector-add.wvr.c[2637,2650] [2025-03-14 01:08:41,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:08:41,142 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:08:41,161 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/popl20-more-vector-add.wvr.c[2637,2650] [2025-03-14 01:08:41,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:08:41,176 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:08:41,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41 WrapperNode [2025-03-14 01:08:41,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:08:41,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:08:41,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:08:41,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:08:41,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,206 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 173 [2025-03-14 01:08:41,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:08:41,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:08:41,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:08:41,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:08:41,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,215 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,232 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 7 writes are split as follows [0, 7]. [2025-03-14 01:08:41,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:08:41,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:08:41,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:08:41,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:08:41,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (1/1) ... [2025-03-14 01:08:41,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:08:41,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:41,266 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-14 01:08:41,269 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-14 01:08:41,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:08:41,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:08:41,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:08:41,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:08:41,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:08:41,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:08:41,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:08:41,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 01:08:41,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 01:08:41,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 01:08:41,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 01:08:41,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:08:41,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:08:41,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:08:41,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 01:08:41,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 01:08:41,286 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:08:41,355 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:08:41,356 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:08:41,616 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:08:41,616 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:08:41,616 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:08:41,842 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:08:41,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:08:41 BoogieIcfgContainer [2025-03-14 01:08:41,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:08:41,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:08:41,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:08:41,863 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:08:41,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:08:40" (1/3) ... [2025-03-14 01:08:41,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:08:41, skipping insertion in model container [2025-03-14 01:08:41,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:08:41" (2/3) ... [2025-03-14 01:08:41,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1532ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:08:41, skipping insertion in model container [2025-03-14 01:08:41,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:08:41" (3/3) ... [2025-03-14 01:08:41,867 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-03-14 01:08:41,878 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:08:41,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 27 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-03-14 01:08:41,880 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:08:41,918 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:08:41,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 33 transitions, 87 flow [2025-03-14 01:08:41,968 INFO L124 PetriNetUnfolderBase]: 7/30 cut-off events. [2025-03-14 01:08:41,971 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:08:41,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 7/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-14 01:08:41,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 33 transitions, 87 flow [2025-03-14 01:08:41,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 76 flow [2025-03-14 01:08:41,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:08:41,996 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;@11e3916b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:08:41,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-14 01:08:42,011 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:08:42,012 INFO L124 PetriNetUnfolderBase]: 7/28 cut-off events. [2025-03-14 01:08:42,012 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:08:42,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:42,012 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] [2025-03-14 01:08:42,013 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-14 01:08:42,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1607718052, now seen corresponding path program 1 times [2025-03-14 01:08:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004414466] [2025-03-14 01:08:42,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:42,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:42,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-14 01:08:42,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-14 01:08:42,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:42,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:42,407 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-14 01:08:42,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:42,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004414466] [2025-03-14 01:08:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004414466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:42,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:42,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:08:42,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889611082] [2025-03-14 01:08:42,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:42,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 01:08:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:42,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 01:08:42,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-14 01:08:42,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:42,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-14 01:08:42,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:42,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:42,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:42,637 INFO L124 PetriNetUnfolderBase]: 411/611 cut-off events. [2025-03-14 01:08:42,638 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-14 01:08:42,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 611 events. 411/611 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1674 event pairs, 248 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 534. Up to 301 conditions per place. [2025-03-14 01:08:42,643 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 24 selfloop transitions, 8 changer transitions 34/67 dead transitions. [2025-03-14 01:08:42,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 67 transitions, 302 flow [2025-03-14 01:08:42,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:08:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:08:42,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-03-14 01:08:42,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2025-03-14 01:08:42,656 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 76 flow. Second operand 5 states and 87 transitions. [2025-03-14 01:08:42,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 67 transitions, 302 flow [2025-03-14 01:08:42,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 67 transitions, 278 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:42,664 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 116 flow [2025-03-14 01:08:42,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2025-03-14 01:08:42,668 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-03-14 01:08:42,669 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 116 flow [2025-03-14 01:08:42,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-14 01:08:42,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:42,669 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-14 01:08:42,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:08:42,669 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-14 01:08:42,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash -649229237, now seen corresponding path program 1 times [2025-03-14 01:08:42,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:42,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834219723] [2025-03-14 01:08:42,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:42,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:08:42,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:42,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:42,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:42,839 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-14 01:08:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834219723] [2025-03-14 01:08:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834219723] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943847713] [2025-03-14 01:08:42,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:42,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:42,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:42,842 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-14 01:08:42,843 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-14 01:08:42,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-14 01:08:42,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-14 01:08:42,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:42,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:08:42,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:42,988 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-14 01:08:42,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:08:43,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943847713] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:43,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:08:43,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-03-14 01:08:43,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111715272] [2025-03-14 01:08:43,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:43,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:08:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:43,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:08:43,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-14 01:08:43,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:43,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-14 01:08:43,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:43,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:43,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:43,154 INFO L124 PetriNetUnfolderBase]: 262/390 cut-off events. [2025-03-14 01:08:43,154 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:08:43,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 390 events. 262/390 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1016 event pairs, 124 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 814. Up to 303 conditions per place. [2025-03-14 01:08:43,159 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2025-03-14 01:08:43,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 230 flow [2025-03-14 01:08:43,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:08:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:08:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2025-03-14 01:08:43,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2025-03-14 01:08:43,160 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 116 flow. Second operand 5 states and 62 transitions. [2025-03-14 01:08:43,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 230 flow [2025-03-14 01:08:43,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 212 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:43,162 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 114 flow [2025-03-14 01:08:43,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2025-03-14 01:08:43,162 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2025-03-14 01:08:43,162 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 114 flow [2025-03-14 01:08:43,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-14 01:08:43,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:43,162 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-14 01:08:43,170 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-14 01:08:43,363 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-14 01:08:43,363 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-14 01:08:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1265382186, now seen corresponding path program 1 times [2025-03-14 01:08:43,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:43,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797329935] [2025-03-14 01:08:43,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:43,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:43,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:08:43,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:43,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:43,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:43,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797329935] [2025-03-14 01:08:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797329935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:43,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549858539] [2025-03-14 01:08:43,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:43,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:43,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:43,526 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-14 01:08:43,528 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-14 01:08:43,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:08:43,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:43,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:43,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:43,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:08:43,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:43,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:43,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:43,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549858539] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:43,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:08:43,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-03-14 01:08:43,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817184752] [2025-03-14 01:08:43,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:43,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:08:43,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:43,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:08:43,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-14 01:08:43,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:43,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-14 01:08:43,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:43,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:43,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:43,971 INFO L124 PetriNetUnfolderBase]: 443/657 cut-off events. [2025-03-14 01:08:43,972 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-03-14 01:08:43,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1577 conditions, 657 events. 443/657 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2090 event pairs, 169 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 1531. Up to 388 conditions per place. [2025-03-14 01:08:43,978 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 61 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-03-14 01:08:43,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 69 transitions, 358 flow [2025-03-14 01:08:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:08:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:08:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2025-03-14 01:08:43,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2025-03-14 01:08:43,980 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 114 flow. Second operand 7 states and 90 transitions. [2025-03-14 01:08:43,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 69 transitions, 358 flow [2025-03-14 01:08:43,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 69 transitions, 338 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:43,982 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 146 flow [2025-03-14 01:08:43,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2025-03-14 01:08:43,983 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2025-03-14 01:08:43,983 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 146 flow [2025-03-14 01:08:43,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-14 01:08:43,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:43,983 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-14 01:08:43,992 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-14 01:08:44,189 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,SelfDestructingSolverStorable2 [2025-03-14 01:08:44,189 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-14 01:08:44,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:44,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1195418836, now seen corresponding path program 2 times [2025-03-14 01:08:44,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:44,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626859065] [2025-03-14 01:08:44,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:08:44,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:44,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:44,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-03-14 01:08:44,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:08:44,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:08:44,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:44,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626859065] [2025-03-14 01:08:44,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626859065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:44,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:44,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:08:44,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003014243] [2025-03-14 01:08:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:44,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:08:44,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:44,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:08:44,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:08:44,319 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:44,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 01:08:44,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:44,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:44,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:44,562 INFO L124 PetriNetUnfolderBase]: 693/1027 cut-off events. [2025-03-14 01:08:44,563 INFO L125 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2025-03-14 01:08:44,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2974 conditions, 1027 events. 693/1027 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3610 event pairs, 291 based on Foata normal form. 1/809 useless extension candidates. Maximal degree in co-relation 2925. Up to 642 conditions per place. [2025-03-14 01:08:44,569 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 65 selfloop transitions, 7 changer transitions 9/82 dead transitions. [2025-03-14 01:08:44,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 82 transitions, 468 flow [2025-03-14 01:08:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:08:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:08:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-03-14 01:08:44,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2025-03-14 01:08:44,571 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 146 flow. Second operand 6 states and 89 transitions. [2025-03-14 01:08:44,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 82 transitions, 468 flow [2025-03-14 01:08:44,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 82 transitions, 447 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:44,573 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2025-03-14 01:08:44,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-03-14 01:08:44,574 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2025-03-14 01:08:44,574 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2025-03-14 01:08:44,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 01:08:44,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:44,574 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-14 01:08:44,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:08:44,575 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-14 01:08:44,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:44,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2002428320, now seen corresponding path program 3 times [2025-03-14 01:08:44,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:44,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829001001] [2025-03-14 01:08:44,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 01:08:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:44,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:44,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-03-14 01:08:44,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-14 01:08:44,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:44,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:08:44,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:44,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829001001] [2025-03-14 01:08:44,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829001001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:44,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:44,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:08:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379499553] [2025-03-14 01:08:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:44,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:08:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:44,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:08:44,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:08:44,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:44,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 01:08:44,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:44,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:44,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:44,912 INFO L124 PetriNetUnfolderBase]: 748/1101 cut-off events. [2025-03-14 01:08:44,912 INFO L125 PetriNetUnfolderBase]: For 1216/1216 co-relation queries the response was YES. [2025-03-14 01:08:44,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1101 events. 748/1101 cut-off events. For 1216/1216 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3945 event pairs, 366 based on Foata normal form. 1/926 useless extension candidates. Maximal degree in co-relation 3645. Up to 827 conditions per place. [2025-03-14 01:08:44,919 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 61 selfloop transitions, 11 changer transitions 9/82 dead transitions. [2025-03-14 01:08:44,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 514 flow [2025-03-14 01:08:44,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:08:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:08:44,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-03-14 01:08:44,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4494949494949495 [2025-03-14 01:08:44,920 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 6 states and 89 transitions. [2025-03-14 01:08:44,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 514 flow [2025-03-14 01:08:44,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 488 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-03-14 01:08:44,926 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 257 flow [2025-03-14 01:08:44,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=257, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2025-03-14 01:08:44,926 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2025-03-14 01:08:44,927 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 257 flow [2025-03-14 01:08:44,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 01:08:44,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:44,927 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-14 01:08:44,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:08:44,927 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-14 01:08:44,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:44,928 INFO L85 PathProgramCache]: Analyzing trace with hash -6978796, now seen corresponding path program 4 times [2025-03-14 01:08:44,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:44,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607662638] [2025-03-14 01:08:44,928 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:44,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:44,943 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-03-14 01:08:44,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:08:44,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607662638] [2025-03-14 01:08:45,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607662638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117132796] [2025-03-14 01:08:45,006 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 01:08:45,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:45,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:45,008 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-14 01:08:45,009 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-14 01:08:45,064 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:45,079 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-03-14 01:08:45,079 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-14 01:08:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:45,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:08:45,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:45,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:45,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117132796] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:08:45,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:08:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-14 01:08:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838331062] [2025-03-14 01:08:45,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:08:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-14 01:08:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:45,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-14 01:08:45,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:08:45,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:45,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 257 flow. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-14 01:08:45,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:45,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:45,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:45,658 INFO L124 PetriNetUnfolderBase]: 911/1349 cut-off events. [2025-03-14 01:08:45,658 INFO L125 PetriNetUnfolderBase]: For 3654/3654 co-relation queries the response was YES. [2025-03-14 01:08:45,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5064 conditions, 1349 events. 911/1349 cut-off events. For 3654/3654 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5528 event pairs, 62 based on Foata normal form. 6/1139 useless extension candidates. Maximal degree in co-relation 5021. Up to 364 conditions per place. [2025-03-14 01:08:45,668 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 161 selfloop transitions, 47 changer transitions 0/209 dead transitions. [2025-03-14 01:08:45,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 209 transitions, 1706 flow [2025-03-14 01:08:45,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-14 01:08:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-14 01:08:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 200 transitions. [2025-03-14 01:08:45,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35650623885918004 [2025-03-14 01:08:45,669 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 257 flow. Second operand 17 states and 200 transitions. [2025-03-14 01:08:45,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 209 transitions, 1706 flow [2025-03-14 01:08:45,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 209 transitions, 1532 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-03-14 01:08:45,680 INFO L231 Difference]: Finished difference. Result has 76 places, 95 transitions, 832 flow [2025-03-14 01:08:45,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=832, PETRI_PLACES=76, PETRI_TRANSITIONS=95} [2025-03-14 01:08:45,681 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2025-03-14 01:08:45,681 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 95 transitions, 832 flow [2025-03-14 01:08:45,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 12 states have internal predecessors, (81), 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-14 01:08:45,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:45,681 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-14 01:08:45,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:08:45,882 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-14 01:08:45,882 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-14 01:08:45,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:45,883 INFO L85 PathProgramCache]: Analyzing trace with hash 155503130, now seen corresponding path program 5 times [2025-03-14 01:08:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395992491] [2025-03-14 01:08:45,883 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:45,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:45,891 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:45,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:45,900 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:45,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395992491] [2025-03-14 01:08:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395992491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007234928] [2025-03-14 01:08:45,986 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 01:08:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:45,989 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-14 01:08:45,991 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-14 01:08:46,048 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:46,071 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:46,071 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:08:46,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:46,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 01:08:46,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:46,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 01:08:46,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007234928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:46,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-14 01:08:46,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-03-14 01:08:46,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364712164] [2025-03-14 01:08:46,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:46,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:08:46,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:46,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:08:46,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-14 01:08:46,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:46,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 95 transitions, 832 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-14 01:08:46,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:46,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:46,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:46,370 INFO L124 PetriNetUnfolderBase]: 914/1365 cut-off events. [2025-03-14 01:08:46,371 INFO L125 PetriNetUnfolderBase]: For 8253/8253 co-relation queries the response was YES. [2025-03-14 01:08:46,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6429 conditions, 1365 events. 914/1365 cut-off events. For 8253/8253 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5324 event pairs, 350 based on Foata normal form. 3/1254 useless extension candidates. Maximal degree in co-relation 6364. Up to 1020 conditions per place. [2025-03-14 01:08:46,380 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 74 selfloop transitions, 54 changer transitions 10/139 dead transitions. [2025-03-14 01:08:46,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 139 transitions, 1411 flow [2025-03-14 01:08:46,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:08:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:08:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2025-03-14 01:08:46,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4069264069264069 [2025-03-14 01:08:46,381 INFO L175 Difference]: Start difference. First operand has 76 places, 95 transitions, 832 flow. Second operand 7 states and 94 transitions. [2025-03-14 01:08:46,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 139 transitions, 1411 flow [2025-03-14 01:08:46,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 139 transitions, 1353 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-03-14 01:08:46,400 INFO L231 Difference]: Finished difference. Result has 85 places, 107 transitions, 1101 flow [2025-03-14 01:08:46,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1101, PETRI_PLACES=85, PETRI_TRANSITIONS=107} [2025-03-14 01:08:46,401 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 53 predicate places. [2025-03-14 01:08:46,402 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 107 transitions, 1101 flow [2025-03-14 01:08:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-14 01:08:46,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:46,402 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-14 01:08:46,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:08:46,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:46,603 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-14 01:08:46,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash -619017916, now seen corresponding path program 6 times [2025-03-14 01:08:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292535802] [2025-03-14 01:08:46,604 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-14 01:08:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:46,612 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 2 equivalence classes. [2025-03-14 01:08:46,619 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 22 of 27 statements. [2025-03-14 01:08:46,619 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-14 01:08:46,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-14 01:08:46,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:46,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292535802] [2025-03-14 01:08:46,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292535802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:08:46,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:08:46,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 01:08:46,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595537163] [2025-03-14 01:08:46,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:46,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:08:46,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:46,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:08:46,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:08:46,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:46,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 107 transitions, 1101 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 01:08:46,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:46,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:46,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:46,887 INFO L124 PetriNetUnfolderBase]: 927/1383 cut-off events. [2025-03-14 01:08:46,887 INFO L125 PetriNetUnfolderBase]: For 9593/9593 co-relation queries the response was YES. [2025-03-14 01:08:46,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7168 conditions, 1383 events. 927/1383 cut-off events. For 9593/9593 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5527 event pairs, 351 based on Foata normal form. 2/1271 useless extension candidates. Maximal degree in co-relation 7098. Up to 1039 conditions per place. [2025-03-14 01:08:46,899 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 97 selfloop transitions, 34 changer transitions 10/142 dead transitions. [2025-03-14 01:08:46,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 142 transitions, 1580 flow [2025-03-14 01:08:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:08:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:08:46,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-03-14 01:08:46,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-03-14 01:08:46,900 INFO L175 Difference]: Start difference. First operand has 85 places, 107 transitions, 1101 flow. Second operand 6 states and 88 transitions. [2025-03-14 01:08:46,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 142 transitions, 1580 flow [2025-03-14 01:08:46,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 142 transitions, 1378 flow, removed 53 selfloop flow, removed 6 redundant places. [2025-03-14 01:08:46,921 INFO L231 Difference]: Finished difference. Result has 83 places, 108 transitions, 1000 flow [2025-03-14 01:08:46,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1000, PETRI_PLACES=83, PETRI_TRANSITIONS=108} [2025-03-14 01:08:46,922 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-03-14 01:08:46,922 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 108 transitions, 1000 flow [2025-03-14 01:08:46,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-14 01:08:46,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:46,922 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-14 01:08:46,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:08:46,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:46,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1979300842, now seen corresponding path program 7 times [2025-03-14 01:08:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:46,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450129683] [2025-03-14 01:08:46,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:46,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:08:46,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:46,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:46,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450129683] [2025-03-14 01:08:47,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450129683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:47,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588360776] [2025-03-14 01:08:47,064 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-14 01:08:47,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:47,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:47,066 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:47,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:08:47,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-14 01:08:47,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-14 01:08:47,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:47,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:47,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:08:47,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:47,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:08:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-14 01:08:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588360776] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-14 01:08:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-03-14 01:08:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009937466] [2025-03-14 01:08:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:08:47,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:08:47,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:08:47,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:08:47,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-03-14 01:08:47,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-03-14 01:08:47,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 108 transitions, 1000 flow. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-14 01:08:47,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:08:47,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-03-14 01:08:47,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:08:47,485 INFO L124 PetriNetUnfolderBase]: 887/1303 cut-off events. [2025-03-14 01:08:47,485 INFO L125 PetriNetUnfolderBase]: For 7596/7596 co-relation queries the response was YES. [2025-03-14 01:08:47,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 1303 events. 887/1303 cut-off events. For 7596/7596 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4901 event pairs, 286 based on Foata normal form. 14/1203 useless extension candidates. Maximal degree in co-relation 6264. Up to 703 conditions per place. [2025-03-14 01:08:47,494 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 74 selfloop transitions, 56 changer transitions 0/131 dead transitions. [2025-03-14 01:08:47,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 1350 flow [2025-03-14 01:08:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-14 01:08:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-14 01:08:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-03-14 01:08:47,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.37662337662337664 [2025-03-14 01:08:47,495 INFO L175 Difference]: Start difference. First operand has 83 places, 108 transitions, 1000 flow. Second operand 7 states and 87 transitions. [2025-03-14 01:08:47,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 1350 flow [2025-03-14 01:08:47,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 1252 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-03-14 01:08:47,512 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 1009 flow [2025-03-14 01:08:47,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1009, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2025-03-14 01:08:47,512 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 51 predicate places. [2025-03-14 01:08:47,512 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 1009 flow [2025-03-14 01:08:47,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-14 01:08:47,512 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:08:47,512 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-14 01:08:47,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 01:08:47,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:47,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-14 01:08:47,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:08:47,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1072861601, now seen corresponding path program 1 times [2025-03-14 01:08:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:08:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467154985] [2025-03-14 01:08:47,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:47,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:08:47,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:08:47,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:08:47,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:47,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:08:48,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:08:48,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467154985] [2025-03-14 01:08:48,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467154985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:08:48,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467002928] [2025-03-14 01:08:48,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:08:48,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:08:48,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:08:48,820 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 01:08:48,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 01:08:48,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-14 01:08:48,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-14 01:08:48,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:08:48,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:08:48,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-14 01:08:48,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:08:48,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:08:48,994 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-14 01:08:48,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-14 01:08:49,059 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-14 01:08:49,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-14 01:08:49,116 INFO L349 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2025-03-14 01:08:49,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 25 [2025-03-14 01:08:49,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2025-03-14 01:08:49,496 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-14 01:08:49,528 INFO L349 Elim1Store]: treesize reduction 44, result has 47.0 percent of original size [2025-03-14 01:08:49,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 62 [2025-03-14 01:08:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-14 01:08:50,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:09:17,886 INFO L349 Elim1Store]: treesize reduction 102, result has 71.5 percent of original size [2025-03-14 01:09:17,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 2074 treesize of output 1105 [2025-03-14 01:09:18,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:09:18,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1113 treesize of output 1055 [2025-03-14 01:09:18,303 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:09:18,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 9 [2025-03-14 01:09:18,878 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:09:18,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 17 [2025-03-14 01:09:19,083 INFO L349 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2025-03-14 01:09:19,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78 [2025-03-14 01:09:19,484 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-14 01:09:19,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 17 [2025-03-14 01:09:52,572 WARN L286 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)